./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label55.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 09a7076b11bd93aa446f64e9d2cfea0a1b6b8e99744d45c786a334a0139444f2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:15:43,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:15:43,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:15:43,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:15:43,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:15:43,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:15:43,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:15:43,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:15:43,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:15:43,702 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:15:43,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:15:43,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:15:43,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:15:43,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:15:43,704 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:15:43,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:15:43,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:15:43,704 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:15:43,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:15:43,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:15:43,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:15:43,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:15:43,706 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:15:43,706 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:15:43,706 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:15:43,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:15:43,707 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:15:43,707 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:15:43,707 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:15:43,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:15:43,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:15:43,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:15:43,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:15:43,707 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:15:43,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:15:43,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:15:43,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:15:43,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:15:43,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:15:43,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:15:43,708 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:15:43,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:15:43,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:15:43,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:15:43,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:15:43,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:15:43,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:15:43,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:15:43,708 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 09a7076b11bd93aa446f64e9d2cfea0a1b6b8e99744d45c786a334a0139444f2 [2025-01-09 00:15:43,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:15:43,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:15:44,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:15:44,003 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:15:44,004 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:15:44,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label55.c [2025-01-09 00:15:45,305 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0af111e3c/30c82f58a0574b33a4ff297e5715ac24/FLAGea2d968c6 [2025-01-09 00:15:45,721 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:15:45,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label55.c [2025-01-09 00:15:45,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0af111e3c/30c82f58a0574b33a4ff297e5715ac24/FLAGea2d968c6 [2025-01-09 00:15:45,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0af111e3c/30c82f58a0574b33a4ff297e5715ac24 [2025-01-09 00:15:45,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:15:45,772 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:15:45,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:15:45,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:15:45,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:15:45,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:15:45" (1/1) ... [2025-01-09 00:15:45,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7382e96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:45, skipping insertion in model container [2025-01-09 00:15:45,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:15:45" (1/1) ... [2025-01-09 00:15:45,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:15:46,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label55.c[1783,1796] [2025-01-09 00:15:46,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:15:46,452 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:15:46,466 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label55.c[1783,1796] [2025-01-09 00:15:46,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:15:46,749 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:15:46,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:46 WrapperNode [2025-01-09 00:15:46,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:15:46,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:15:46,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:15:46,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:15:46,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:46" (1/1) ... [2025-01-09 00:15:46,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:46" (1/1) ... [2025-01-09 00:15:47,074 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:15:47,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:15:47,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:15:47,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:15:47,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:15:47,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:46" (1/1) ... [2025-01-09 00:15:47,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:46" (1/1) ... [2025-01-09 00:15:47,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:46" (1/1) ... [2025-01-09 00:15:47,303 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:15:47,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:46" (1/1) ... [2025-01-09 00:15:47,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:46" (1/1) ... [2025-01-09 00:15:47,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:46" (1/1) ... [2025-01-09 00:15:47,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:46" (1/1) ... [2025-01-09 00:15:47,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:46" (1/1) ... [2025-01-09 00:15:47,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:46" (1/1) ... [2025-01-09 00:15:47,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:46" (1/1) ... [2025-01-09 00:15:47,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:15:47,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:15:47,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:15:47,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:15:47,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:46" (1/1) ... [2025-01-09 00:15:47,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:15:47,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:15:47,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:15:47,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:15:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:15:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:15:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:15:47,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:15:47,665 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:15:47,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:15:51,065 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:15:51,065 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:15:51,094 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:15:51,099 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:15:51,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:15:51 BoogieIcfgContainer [2025-01-09 00:15:51,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:15:51,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:15:51,103 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:15:51,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:15:51,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:15:45" (1/3) ... [2025-01-09 00:15:51,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7f586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:15:51, skipping insertion in model container [2025-01-09 00:15:51,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:46" (2/3) ... [2025-01-09 00:15:51,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7f586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:15:51, skipping insertion in model container [2025-01-09 00:15:51,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:15:51" (3/3) ... [2025-01-09 00:15:51,110 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label55.c [2025-01-09 00:15:51,124 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:15:51,126 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label55.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:15:51,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:15:51,212 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@687234c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:15:51,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:15:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:51,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 00:15:51,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:51,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:51,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:51,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:51,231 INFO L85 PathProgramCache]: Analyzing trace with hash -955436260, now seen corresponding path program 1 times [2025-01-09 00:15:51,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:51,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446012699] [2025-01-09 00:15:51,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:51,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:51,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 00:15:51,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 00:15:51,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:51,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:51,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:51,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446012699] [2025-01-09 00:15:51,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446012699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:51,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:51,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:51,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517489657] [2025-01-09 00:15:51,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:51,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:51,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:51,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:51,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:51,456 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:53,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:53,860 INFO L93 Difference]: Finished difference Result 1680 states and 3071 transitions. [2025-01-09 00:15:53,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:53,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 00:15:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:53,876 INFO L225 Difference]: With dead ends: 1680 [2025-01-09 00:15:53,876 INFO L226 Difference]: Without dead ends: 1011 [2025-01-09 00:15:53,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:53,884 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 570 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:53,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 220 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 00:15:53,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-01-09 00:15:53,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 996. [2025-01-09 00:15:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 1.735678391959799) internal successors, (1727), 995 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1727 transitions. [2025-01-09 00:15:53,968 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1727 transitions. Word has length 11 [2025-01-09 00:15:53,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:53,968 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1727 transitions. [2025-01-09 00:15:53,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1727 transitions. [2025-01-09 00:15:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 00:15:53,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:53,973 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:53,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:15:53,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:53,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:53,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1880539195, now seen corresponding path program 1 times [2025-01-09 00:15:53,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:53,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282606483] [2025-01-09 00:15:53,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:53,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:53,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 00:15:54,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 00:15:54,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:54,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:54,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:54,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282606483] [2025-01-09 00:15:54,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282606483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:54,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:54,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:54,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779210362] [2025-01-09 00:15:54,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:54,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:54,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:54,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:54,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:54,389 INFO L87 Difference]: Start difference. First operand 996 states and 1727 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:56,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:56,440 INFO L93 Difference]: Finished difference Result 2866 states and 5020 transitions. [2025-01-09 00:15:56,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:56,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 00:15:56,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:56,449 INFO L225 Difference]: With dead ends: 2866 [2025-01-09 00:15:56,449 INFO L226 Difference]: Without dead ends: 1872 [2025-01-09 00:15:56,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:56,452 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 405 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:56,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 463 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:15:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2025-01-09 00:15:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1865. [2025-01-09 00:15:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1864 states have (on average 1.5187768240343347) internal successors, (2831), 1864 states have internal predecessors, (2831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2831 transitions. [2025-01-09 00:15:56,532 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2831 transitions. Word has length 76 [2025-01-09 00:15:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:56,532 INFO L471 AbstractCegarLoop]: Abstraction has 1865 states and 2831 transitions. [2025-01-09 00:15:56,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2831 transitions. [2025-01-09 00:15:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 00:15:56,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:56,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:56,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:15:56,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:56,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:56,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1361528438, now seen corresponding path program 1 times [2025-01-09 00:15:56,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:56,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241505889] [2025-01-09 00:15:56,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:56,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:56,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 00:15:56,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 00:15:56,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:56,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:56,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:56,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241505889] [2025-01-09 00:15:56,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241505889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:56,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:56,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:56,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884662816] [2025-01-09 00:15:56,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:56,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:56,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:56,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:56,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:56,772 INFO L87 Difference]: Start difference. First operand 1865 states and 2831 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:58,906 INFO L93 Difference]: Finished difference Result 5051 states and 7604 transitions. [2025-01-09 00:15:58,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:58,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 00:15:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:58,922 INFO L225 Difference]: With dead ends: 5051 [2025-01-09 00:15:58,922 INFO L226 Difference]: Without dead ends: 3188 [2025-01-09 00:15:58,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:58,929 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 444 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:58,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 240 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:15:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2025-01-09 00:15:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3166. [2025-01-09 00:15:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3166 states, 3165 states have (on average 1.4451816745655608) internal successors, (4574), 3165 states have internal predecessors, (4574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3166 states to 3166 states and 4574 transitions. [2025-01-09 00:15:59,006 INFO L78 Accepts]: Start accepts. Automaton has 3166 states and 4574 transitions. Word has length 78 [2025-01-09 00:15:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:59,008 INFO L471 AbstractCegarLoop]: Abstraction has 3166 states and 4574 transitions. [2025-01-09 00:15:59,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3166 states and 4574 transitions. [2025-01-09 00:15:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 00:15:59,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:59,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:59,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:15:59,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:59,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:59,011 INFO L85 PathProgramCache]: Analyzing trace with hash 513073263, now seen corresponding path program 1 times [2025-01-09 00:15:59,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:59,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525157700] [2025-01-09 00:15:59,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:59,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:59,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 00:15:59,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 00:15:59,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:59,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:59,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:59,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525157700] [2025-01-09 00:15:59,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525157700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:59,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:59,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:59,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992315421] [2025-01-09 00:15:59,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:59,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:59,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:59,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:59,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:59,234 INFO L87 Difference]: Start difference. First operand 3166 states and 4574 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:01,283 INFO L93 Difference]: Finished difference Result 7194 states and 10893 transitions. [2025-01-09 00:16:01,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:01,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 00:16:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:01,301 INFO L225 Difference]: With dead ends: 7194 [2025-01-09 00:16:01,302 INFO L226 Difference]: Without dead ends: 4455 [2025-01-09 00:16:01,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:01,309 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 481 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:01,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 919 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:16:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4455 states. [2025-01-09 00:16:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4455 to 4452. [2025-01-09 00:16:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4452 states, 4451 states have (on average 1.3895753763199281) internal successors, (6185), 4451 states have internal predecessors, (6185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4452 states to 4452 states and 6185 transitions. [2025-01-09 00:16:01,396 INFO L78 Accepts]: Start accepts. Automaton has 4452 states and 6185 transitions. Word has length 81 [2025-01-09 00:16:01,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:01,398 INFO L471 AbstractCegarLoop]: Abstraction has 4452 states and 6185 transitions. [2025-01-09 00:16:01,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4452 states and 6185 transitions. [2025-01-09 00:16:01,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 00:16:01,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:01,401 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:01,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:16:01,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:01,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:01,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1949469996, now seen corresponding path program 1 times [2025-01-09 00:16:01,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:01,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106123501] [2025-01-09 00:16:01,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:01,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:01,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 00:16:01,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 00:16:01,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:01,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:01,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:01,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106123501] [2025-01-09 00:16:01,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106123501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:01,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:01,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:16:01,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900134520] [2025-01-09 00:16:01,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:01,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:01,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:01,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:01,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:01,517 INFO L87 Difference]: Start difference. First operand 4452 states and 6185 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:03,317 INFO L93 Difference]: Finished difference Result 12770 states and 17843 transitions. [2025-01-09 00:16:03,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:03,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-01-09 00:16:03,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:03,340 INFO L225 Difference]: With dead ends: 12770 [2025-01-09 00:16:03,340 INFO L226 Difference]: Without dead ends: 8320 [2025-01-09 00:16:03,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:03,348 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 402 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:03,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:16:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8320 states. [2025-01-09 00:16:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8320 to 7460. [2025-01-09 00:16:03,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7460 states, 7459 states have (on average 1.2756401662421235) internal successors, (9515), 7459 states have internal predecessors, (9515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7460 states to 7460 states and 9515 transitions. [2025-01-09 00:16:03,486 INFO L78 Accepts]: Start accepts. Automaton has 7460 states and 9515 transitions. Word has length 83 [2025-01-09 00:16:03,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:03,487 INFO L471 AbstractCegarLoop]: Abstraction has 7460 states and 9515 transitions. [2025-01-09 00:16:03,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:03,488 INFO L276 IsEmpty]: Start isEmpty. Operand 7460 states and 9515 transitions. [2025-01-09 00:16:03,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 00:16:03,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:03,494 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:03,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:16:03,495 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:03,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:03,495 INFO L85 PathProgramCache]: Analyzing trace with hash -57405988, now seen corresponding path program 1 times [2025-01-09 00:16:03,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:03,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304889727] [2025-01-09 00:16:03,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:03,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:03,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 00:16:03,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 00:16:03,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:03,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-09 00:16:03,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:03,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304889727] [2025-01-09 00:16:03,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304889727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:03,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:03,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:16:03,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246141477] [2025-01-09 00:16:03,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:03,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:03,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:03,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:03,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:03,758 INFO L87 Difference]: Start difference. First operand 7460 states and 9515 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:05,497 INFO L93 Difference]: Finished difference Result 21724 states and 27770 transitions. [2025-01-09 00:16:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:05,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-01-09 00:16:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:05,566 INFO L225 Difference]: With dead ends: 21724 [2025-01-09 00:16:05,566 INFO L226 Difference]: Without dead ends: 12137 [2025-01-09 00:16:05,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:05,584 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:05,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:16:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12137 states. [2025-01-09 00:16:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12137 to 9155. [2025-01-09 00:16:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9155 states, 9154 states have (on average 1.1728206248634476) internal successors, (10736), 9154 states have internal predecessors, (10736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9155 states to 9155 states and 10736 transitions. [2025-01-09 00:16:05,737 INFO L78 Accepts]: Start accepts. Automaton has 9155 states and 10736 transitions. Word has length 150 [2025-01-09 00:16:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:05,737 INFO L471 AbstractCegarLoop]: Abstraction has 9155 states and 10736 transitions. [2025-01-09 00:16:05,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 9155 states and 10736 transitions. [2025-01-09 00:16:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 00:16:05,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:05,739 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:05,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:16:05,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:05,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:05,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1430002937, now seen corresponding path program 1 times [2025-01-09 00:16:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:05,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781231753] [2025-01-09 00:16:05,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:05,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:05,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 00:16:05,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 00:16:05,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:05,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:05,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:05,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781231753] [2025-01-09 00:16:05,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781231753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:05,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:05,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:05,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085969703] [2025-01-09 00:16:05,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:05,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:05,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:05,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:05,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:05,940 INFO L87 Difference]: Start difference. First operand 9155 states and 10736 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:07,384 INFO L93 Difference]: Finished difference Result 22981 states and 27401 transitions. [2025-01-09 00:16:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:07,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2025-01-09 00:16:07,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:07,409 INFO L225 Difference]: With dead ends: 22981 [2025-01-09 00:16:07,409 INFO L226 Difference]: Without dead ends: 13828 [2025-01-09 00:16:07,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:07,420 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:07,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 779 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:16:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13828 states. [2025-01-09 00:16:07,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13828 to 13403. [2025-01-09 00:16:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13403 states, 13402 states have (on average 1.1594538128637517) internal successors, (15539), 13402 states have internal predecessors, (15539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13403 states to 13403 states and 15539 transitions. [2025-01-09 00:16:07,656 INFO L78 Accepts]: Start accepts. Automaton has 13403 states and 15539 transitions. Word has length 163 [2025-01-09 00:16:07,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:07,656 INFO L471 AbstractCegarLoop]: Abstraction has 13403 states and 15539 transitions. [2025-01-09 00:16:07,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 13403 states and 15539 transitions. [2025-01-09 00:16:07,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-01-09 00:16:07,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:07,662 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:07,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:16:07,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:07,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:07,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1917429796, now seen corresponding path program 1 times [2025-01-09 00:16:07,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:07,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824478830] [2025-01-09 00:16:07,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:07,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:07,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-09 00:16:07,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-09 00:16:07,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:07,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 00:16:07,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:07,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824478830] [2025-01-09 00:16:07,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824478830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:07,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:07,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:07,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707292143] [2025-01-09 00:16:07,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:07,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:07,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:07,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:07,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:07,926 INFO L87 Difference]: Start difference. First operand 13403 states and 15539 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:09,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:09,602 INFO L93 Difference]: Finished difference Result 32740 states and 38269 transitions. [2025-01-09 00:16:09,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:09,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 243 [2025-01-09 00:16:09,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:09,639 INFO L225 Difference]: With dead ends: 32740 [2025-01-09 00:16:09,639 INFO L226 Difference]: Without dead ends: 18064 [2025-01-09 00:16:09,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:09,653 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 387 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:09,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 850 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:16:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18064 states. [2025-01-09 00:16:09,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18064 to 18064. [2025-01-09 00:16:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18064 states, 18063 states have (on average 1.1204118917123402) internal successors, (20238), 18063 states have internal predecessors, (20238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18064 states to 18064 states and 20238 transitions. [2025-01-09 00:16:09,856 INFO L78 Accepts]: Start accepts. Automaton has 18064 states and 20238 transitions. Word has length 243 [2025-01-09 00:16:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:09,857 INFO L471 AbstractCegarLoop]: Abstraction has 18064 states and 20238 transitions. [2025-01-09 00:16:09,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 18064 states and 20238 transitions. [2025-01-09 00:16:09,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-01-09 00:16:09,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:09,865 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:09,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:16:09,865 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:09,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:09,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1452140105, now seen corresponding path program 1 times [2025-01-09 00:16:09,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:09,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695081512] [2025-01-09 00:16:09,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:09,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-01-09 00:16:09,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-01-09 00:16:09,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:09,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-01-09 00:16:10,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:10,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695081512] [2025-01-09 00:16:10,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695081512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:10,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:10,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:10,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288906178] [2025-01-09 00:16:10,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:10,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:10,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:10,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:10,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:10,079 INFO L87 Difference]: Start difference. First operand 18064 states and 20238 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:11,833 INFO L93 Difference]: Finished difference Result 42080 states and 47509 transitions. [2025-01-09 00:16:11,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:11,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 283 [2025-01-09 00:16:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:11,872 INFO L225 Difference]: With dead ends: 42080 [2025-01-09 00:16:11,873 INFO L226 Difference]: Without dead ends: 23144 [2025-01-09 00:16:11,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:11,890 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 527 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:11,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 669 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:16:11,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23144 states. [2025-01-09 00:16:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23144 to 23142. [2025-01-09 00:16:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23142 states, 23141 states have (on average 1.1141264422453654) internal successors, (25782), 23141 states have internal predecessors, (25782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23142 states to 23142 states and 25782 transitions. [2025-01-09 00:16:12,224 INFO L78 Accepts]: Start accepts. Automaton has 23142 states and 25782 transitions. Word has length 283 [2025-01-09 00:16:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:12,224 INFO L471 AbstractCegarLoop]: Abstraction has 23142 states and 25782 transitions. [2025-01-09 00:16:12,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 23142 states and 25782 transitions. [2025-01-09 00:16:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-09 00:16:12,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:12,244 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:12,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:16:12,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:12,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:12,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1881173716, now seen corresponding path program 1 times [2025-01-09 00:16:12,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:12,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091182113] [2025-01-09 00:16:12,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:12,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:12,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 00:16:12,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 00:16:12,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:12,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:12,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:12,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091182113] [2025-01-09 00:16:12,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091182113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:12,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:12,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439613152] [2025-01-09 00:16:12,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:12,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:12,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:12,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:12,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:12,935 INFO L87 Difference]: Start difference. First operand 23142 states and 25782 transitions. Second operand has 4 states, 4 states have (on average 87.5) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:15,255 INFO L93 Difference]: Finished difference Result 53132 states and 59420 transitions. [2025-01-09 00:16:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:15,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.5) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350 [2025-01-09 00:16:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:15,290 INFO L225 Difference]: With dead ends: 53132 [2025-01-09 00:16:15,290 INFO L226 Difference]: Without dead ends: 29567 [2025-01-09 00:16:15,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:15,304 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 641 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 2419 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 2419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:15,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 269 Invalid, 2677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 2419 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:16:15,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29567 states. [2025-01-09 00:16:15,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29567 to 29562. [2025-01-09 00:16:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29562 states, 29561 states have (on average 1.1230675552247895) internal successors, (33199), 29561 states have internal predecessors, (33199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:15,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29562 states to 29562 states and 33199 transitions. [2025-01-09 00:16:15,642 INFO L78 Accepts]: Start accepts. Automaton has 29562 states and 33199 transitions. Word has length 350 [2025-01-09 00:16:15,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:15,643 INFO L471 AbstractCegarLoop]: Abstraction has 29562 states and 33199 transitions. [2025-01-09 00:16:15,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.5) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:15,643 INFO L276 IsEmpty]: Start isEmpty. Operand 29562 states and 33199 transitions. [2025-01-09 00:16:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-01-09 00:16:15,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:15,653 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:15,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:16:15,653 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:15,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:15,654 INFO L85 PathProgramCache]: Analyzing trace with hash 916527724, now seen corresponding path program 1 times [2025-01-09 00:16:15,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:15,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084863598] [2025-01-09 00:16:15,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:15,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:15,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-01-09 00:16:15,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-01-09 00:16:15,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:15,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 17 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:16,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:16,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084863598] [2025-01-09 00:16:16,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084863598] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:16,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364144324] [2025-01-09 00:16:16,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:16,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:16,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:16:16,225 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:16:16,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:16:16,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-01-09 00:16:16,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-01-09 00:16:16,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:16,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:16,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:16:16,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:16:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 17 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:17,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:16:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:17,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364144324] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:17,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:16:17,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-09 00:16:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495317526] [2025-01-09 00:16:17,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:17,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:17,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:17,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:17,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:16:17,727 INFO L87 Difference]: Start difference. First operand 29562 states and 33199 transitions. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:20,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:20,079 INFO L93 Difference]: Finished difference Result 65077 states and 73082 transitions. [2025-01-09 00:16:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:20,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 378 [2025-01-09 00:16:20,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:20,112 INFO L225 Difference]: With dead ends: 65077 [2025-01-09 00:16:20,113 INFO L226 Difference]: Without dead ends: 34665 [2025-01-09 00:16:20,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 753 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:16:20,129 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 633 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:20,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 155 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:16:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34665 states. [2025-01-09 00:16:20,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34665 to 29560. [2025-01-09 00:16:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29560 states, 29559 states have (on average 1.1231097127778342) internal successors, (33198), 29559 states have internal predecessors, (33198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29560 states to 29560 states and 33198 transitions. [2025-01-09 00:16:20,482 INFO L78 Accepts]: Start accepts. Automaton has 29560 states and 33198 transitions. Word has length 378 [2025-01-09 00:16:20,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:20,483 INFO L471 AbstractCegarLoop]: Abstraction has 29560 states and 33198 transitions. [2025-01-09 00:16:20,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:20,483 INFO L276 IsEmpty]: Start isEmpty. Operand 29560 states and 33198 transitions. [2025-01-09 00:16:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-01-09 00:16:20,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:20,497 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:20,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:16:20,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 00:16:20,699 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:20,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:20,700 INFO L85 PathProgramCache]: Analyzing trace with hash 828278665, now seen corresponding path program 1 times [2025-01-09 00:16:20,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:20,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769460478] [2025-01-09 00:16:20,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:20,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:20,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-01-09 00:16:20,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-01-09 00:16:20,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:20,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 26 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:21,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:21,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769460478] [2025-01-09 00:16:21,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769460478] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:21,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198506497] [2025-01-09 00:16:21,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:21,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:21,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:16:21,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:16:21,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:16:21,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-01-09 00:16:21,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-01-09 00:16:21,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:21,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:21,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:16:21,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:16:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 173 proven. 73 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 00:16:21,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:16:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 00:16:22,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198506497] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:22,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:16:22,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2025-01-09 00:16:22,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31737332] [2025-01-09 00:16:22,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:22,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:22,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:22,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:22,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:16:22,248 INFO L87 Difference]: Start difference. First operand 29560 states and 33198 transitions. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:24,810 INFO L93 Difference]: Finished difference Result 75333 states and 84742 transitions. [2025-01-09 00:16:24,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:24,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 452 [2025-01-09 00:16:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:24,860 INFO L225 Difference]: With dead ends: 75333 [2025-01-09 00:16:24,860 INFO L226 Difference]: Without dead ends: 46200 [2025-01-09 00:16:24,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 901 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:16:24,877 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 839 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:24,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 187 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 00:16:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46200 states. [2025-01-09 00:16:25,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46200 to 43218. [2025-01-09 00:16:25,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43218 states, 43217 states have (on average 1.126547423467617) internal successors, (48686), 43217 states have internal predecessors, (48686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43218 states to 43218 states and 48686 transitions. [2025-01-09 00:16:25,523 INFO L78 Accepts]: Start accepts. Automaton has 43218 states and 48686 transitions. Word has length 452 [2025-01-09 00:16:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:25,524 INFO L471 AbstractCegarLoop]: Abstraction has 43218 states and 48686 transitions. [2025-01-09 00:16:25,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 43218 states and 48686 transitions. [2025-01-09 00:16:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-01-09 00:16:25,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:25,543 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:25,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:16:25,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:25,744 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:25,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:25,746 INFO L85 PathProgramCache]: Analyzing trace with hash -191442632, now seen corresponding path program 1 times [2025-01-09 00:16:25,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:25,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694582420] [2025-01-09 00:16:25,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:25,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:25,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-01-09 00:16:25,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-01-09 00:16:25,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:25,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2025-01-09 00:16:26,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:26,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694582420] [2025-01-09 00:16:26,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694582420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:26,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:26,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:26,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164276639] [2025-01-09 00:16:26,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:26,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:26,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:26,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:26,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:26,070 INFO L87 Difference]: Start difference. First operand 43218 states and 48686 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:27,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:27,723 INFO L93 Difference]: Finished difference Result 97916 states and 110462 transitions. [2025-01-09 00:16:27,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:27,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 508 [2025-01-09 00:16:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:27,785 INFO L225 Difference]: With dead ends: 97916 [2025-01-09 00:16:27,785 INFO L226 Difference]: Without dead ends: 51287 [2025-01-09 00:16:27,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:27,814 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 491 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:27,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 719 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:16:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51287 states. [2025-01-09 00:16:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51287 to 51278. [2025-01-09 00:16:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51278 states, 51277 states have (on average 1.1109659301441193) internal successors, (56967), 51277 states have internal predecessors, (56967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51278 states to 51278 states and 56967 transitions. [2025-01-09 00:16:28,467 INFO L78 Accepts]: Start accepts. Automaton has 51278 states and 56967 transitions. Word has length 508 [2025-01-09 00:16:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:28,469 INFO L471 AbstractCegarLoop]: Abstraction has 51278 states and 56967 transitions. [2025-01-09 00:16:28,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 51278 states and 56967 transitions. [2025-01-09 00:16:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2025-01-09 00:16:28,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:28,485 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:28,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:16:28,485 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:28,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:28,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1000444085, now seen corresponding path program 1 times [2025-01-09 00:16:28,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:28,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694869494] [2025-01-09 00:16:28,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:28,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:28,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 558 statements into 1 equivalence classes. [2025-01-09 00:16:28,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 558 of 558 statements. [2025-01-09 00:16:28,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:28,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 452 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 00:16:28,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:28,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694869494] [2025-01-09 00:16:28,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694869494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:28,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:28,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:28,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035726541] [2025-01-09 00:16:28,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:28,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:28,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:28,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:28,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:28,981 INFO L87 Difference]: Start difference. First operand 51278 states and 56967 transitions. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:30,673 INFO L93 Difference]: Finished difference Result 114486 states and 127528 transitions. [2025-01-09 00:16:30,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:30,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 558 [2025-01-09 00:16:30,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:30,752 INFO L225 Difference]: With dead ends: 114486 [2025-01-09 00:16:30,752 INFO L226 Difference]: Without dead ends: 62358 [2025-01-09 00:16:30,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:30,775 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 428 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:30,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 640 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:16:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62358 states. [2025-01-09 00:16:31,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62358 to 59374. [2025-01-09 00:16:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59374 states, 59373 states have (on average 1.1135532986374277) internal successors, (66115), 59373 states have internal predecessors, (66115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59374 states to 59374 states and 66115 transitions. [2025-01-09 00:16:31,457 INFO L78 Accepts]: Start accepts. Automaton has 59374 states and 66115 transitions. Word has length 558 [2025-01-09 00:16:31,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:31,458 INFO L471 AbstractCegarLoop]: Abstraction has 59374 states and 66115 transitions. [2025-01-09 00:16:31,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:31,458 INFO L276 IsEmpty]: Start isEmpty. Operand 59374 states and 66115 transitions. [2025-01-09 00:16:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2025-01-09 00:16:31,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:31,471 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:31,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:16:31,472 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:31,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:31,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1687920220, now seen corresponding path program 1 times [2025-01-09 00:16:31,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:31,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660445245] [2025-01-09 00:16:31,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:31,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:31,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-01-09 00:16:31,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-01-09 00:16:31,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:31,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 00:16:32,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:32,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660445245] [2025-01-09 00:16:32,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660445245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:32,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:32,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:16:32,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378079318] [2025-01-09 00:16:32,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:32,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:32,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:32,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:32,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:32,179 INFO L87 Difference]: Start difference. First operand 59374 states and 66115 transitions. Second operand has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:34,659 INFO L93 Difference]: Finished difference Result 149902 states and 166928 transitions. [2025-01-09 00:16:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:34,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 562 [2025-01-09 00:16:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:34,757 INFO L225 Difference]: With dead ends: 149902 [2025-01-09 00:16:34,757 INFO L226 Difference]: Without dead ends: 90955 [2025-01-09 00:16:34,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:34,793 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 808 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:34,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 202 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 2298 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:16:34,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90955 states. [2025-01-09 00:16:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90955 to 84139. [2025-01-09 00:16:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84139 states, 84138 states have (on average 1.116392117711379) internal successors, (93931), 84138 states have internal predecessors, (93931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84139 states to 84139 states and 93931 transitions. [2025-01-09 00:16:35,894 INFO L78 Accepts]: Start accepts. Automaton has 84139 states and 93931 transitions. Word has length 562 [2025-01-09 00:16:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:35,894 INFO L471 AbstractCegarLoop]: Abstraction has 84139 states and 93931 transitions. [2025-01-09 00:16:35,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 84139 states and 93931 transitions. [2025-01-09 00:16:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-01-09 00:16:35,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:35,909 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:35,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:16:35,909 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:35,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:35,910 INFO L85 PathProgramCache]: Analyzing trace with hash 798280163, now seen corresponding path program 1 times [2025-01-09 00:16:35,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:35,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984245354] [2025-01-09 00:16:35,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:35,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:35,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-01-09 00:16:36,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-01-09 00:16:36,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:36,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 371 proven. 82 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-09 00:16:37,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:37,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984245354] [2025-01-09 00:16:37,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984245354] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:37,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209469963] [2025-01-09 00:16:37,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:37,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:37,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:16:37,429 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:16:37,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:16:37,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-01-09 00:16:37,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-01-09 00:16:37,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:37,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:37,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 00:16:37,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:16:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 371 proven. 82 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-09 00:16:38,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:16:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 452 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-09 00:16:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209469963] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:16:39,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:16:39,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-01-09 00:16:39,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948189092] [2025-01-09 00:16:39,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:16:39,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 00:16:39,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:39,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 00:16:39,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:16:39,615 INFO L87 Difference]: Start difference. First operand 84139 states and 93931 transitions. Second operand has 10 states, 10 states have (on average 82.8) internal successors, (828), 9 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:44,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:44,324 INFO L93 Difference]: Finished difference Result 185962 states and 207679 transitions. [2025-01-09 00:16:44,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 00:16:44,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 82.8) internal successors, (828), 9 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 577 [2025-01-09 00:16:44,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:44,450 INFO L225 Difference]: With dead ends: 185962 [2025-01-09 00:16:44,451 INFO L226 Difference]: Without dead ends: 102250 [2025-01-09 00:16:44,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1163 GetRequests, 1149 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-09 00:16:44,507 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 2900 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 5949 mSolverCounterSat, 840 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2900 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 6789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 840 IncrementalHoareTripleChecker+Valid, 5949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:44,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2900 Valid, 373 Invalid, 6789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [840 Valid, 5949 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 00:16:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102250 states. [2025-01-09 00:16:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102250 to 89218. [2025-01-09 00:16:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89218 states, 89217 states have (on average 1.1121647219700281) internal successors, (99224), 89217 states have internal predecessors, (99224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89218 states to 89218 states and 99224 transitions. [2025-01-09 00:16:45,886 INFO L78 Accepts]: Start accepts. Automaton has 89218 states and 99224 transitions. Word has length 577 [2025-01-09 00:16:45,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:45,887 INFO L471 AbstractCegarLoop]: Abstraction has 89218 states and 99224 transitions. [2025-01-09 00:16:45,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 82.8) internal successors, (828), 9 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:45,887 INFO L276 IsEmpty]: Start isEmpty. Operand 89218 states and 99224 transitions. [2025-01-09 00:16:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2025-01-09 00:16:45,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:45,910 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:45,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:16:46,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:46,111 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:46,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:46,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1452398348, now seen corresponding path program 1 times [2025-01-09 00:16:46,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:46,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75254501] [2025-01-09 00:16:46,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:46,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:46,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 637 statements into 1 equivalence classes. [2025-01-09 00:16:46,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 637 of 637 statements. [2025-01-09 00:16:46,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:46,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 597 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2025-01-09 00:16:46,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:46,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75254501] [2025-01-09 00:16:46,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75254501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:46,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:46,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:46,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153416321] [2025-01-09 00:16:46,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:46,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:46,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:46,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:46,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:46,743 INFO L87 Difference]: Start difference. First operand 89218 states and 99224 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:48,672 INFO L93 Difference]: Finished difference Result 203544 states and 226398 transitions. [2025-01-09 00:16:48,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:48,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 637 [2025-01-09 00:16:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:48,871 INFO L225 Difference]: With dead ends: 203544 [2025-01-09 00:16:48,871 INFO L226 Difference]: Without dead ends: 114751 [2025-01-09 00:16:48,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:48,944 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 426 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:48,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 339 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:16:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114751 states. [2025-01-09 00:16:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114751 to 109202. [2025-01-09 00:16:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109202 states, 109201 states have (on average 1.0992023882565178) internal successors, (120034), 109201 states have internal predecessors, (120034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109202 states to 109202 states and 120034 transitions. [2025-01-09 00:16:50,221 INFO L78 Accepts]: Start accepts. Automaton has 109202 states and 120034 transitions. Word has length 637 [2025-01-09 00:16:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:50,221 INFO L471 AbstractCegarLoop]: Abstraction has 109202 states and 120034 transitions. [2025-01-09 00:16:50,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 109202 states and 120034 transitions. [2025-01-09 00:16:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2025-01-09 00:16:50,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:50,235 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:50,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:16:50,235 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:50,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1853296651, now seen corresponding path program 1 times [2025-01-09 00:16:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:50,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798092706] [2025-01-09 00:16:50,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:50,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 659 statements into 1 equivalence classes. [2025-01-09 00:16:50,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 659 of 659 statements. [2025-01-09 00:16:50,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:50,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-01-09 00:16:51,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:51,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798092706] [2025-01-09 00:16:51,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798092706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:51,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:51,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:51,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594421171] [2025-01-09 00:16:51,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:51,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:51,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:51,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:51,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:51,211 INFO L87 Difference]: Start difference. First operand 109202 states and 120034 transitions. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:52,876 INFO L93 Difference]: Finished difference Result 231180 states and 253919 transitions. [2025-01-09 00:16:52,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:52,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 659 [2025-01-09 00:16:52,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:53,026 INFO L225 Difference]: With dead ends: 231180 [2025-01-09 00:16:53,026 INFO L226 Difference]: Without dead ends: 122405 [2025-01-09 00:16:53,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:53,092 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 329 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:53,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 751 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:16:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122405 states. [2025-01-09 00:16:54,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122405 to 119413. [2025-01-09 00:16:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119413 states, 119412 states have (on average 1.0929471074933843) internal successors, (130511), 119412 states have internal predecessors, (130511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:54,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119413 states to 119413 states and 130511 transitions. [2025-01-09 00:16:54,677 INFO L78 Accepts]: Start accepts. Automaton has 119413 states and 130511 transitions. Word has length 659 [2025-01-09 00:16:54,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:54,677 INFO L471 AbstractCegarLoop]: Abstraction has 119413 states and 130511 transitions. [2025-01-09 00:16:54,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:54,677 INFO L276 IsEmpty]: Start isEmpty. Operand 119413 states and 130511 transitions. [2025-01-09 00:16:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-01-09 00:16:54,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:54,699 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:54,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:16:54,699 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:54,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:54,700 INFO L85 PathProgramCache]: Analyzing trace with hash -526254862, now seen corresponding path program 1 times [2025-01-09 00:16:54,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:54,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505199312] [2025-01-09 00:16:54,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:54,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:54,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-01-09 00:16:54,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-01-09 00:16:54,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:54,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-01-09 00:16:55,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:55,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505199312] [2025-01-09 00:16:55,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505199312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:55,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:55,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:55,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051840729] [2025-01-09 00:16:55,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:55,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:55,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:55,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:55,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:55,351 INFO L87 Difference]: Start difference. First operand 119413 states and 130511 transitions. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:57,262 INFO L93 Difference]: Finished difference Result 251174 states and 274569 transitions. [2025-01-09 00:16:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:57,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 709 [2025-01-09 00:16:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted.