./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label36.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/Problem13_label36.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 e5aa96fbac0e92c80f1f80982b7986fb62416e04af83c742e32bbaeb89f3bf9f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:53:46,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:53:46,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:53:46,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:53:46,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:53:46,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:53:46,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:53:46,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:53:46,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:53:46,517 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:53:46,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:53:46,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:53:46,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:53:46,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:53:46,518 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:53:46,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:53:46,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:53:46,518 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:53:46,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:53:46,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:53:46,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:53:46,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:53:46,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:53:46,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:53:46,518 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:53:46,518 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:53:46,518 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:53:46,518 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:53:46,519 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:53:46,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:53:46,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:53:46,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:53:46,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:53:46,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:53:46,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:53:46,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:53:46,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:53:46,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:53:46,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:53:46,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:53:46,519 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:53:46,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:53:46,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:53:46,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:53:46,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:53:46,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:53:46,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:53:46,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:53:46,520 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 -> e5aa96fbac0e92c80f1f80982b7986fb62416e04af83c742e32bbaeb89f3bf9f [2025-01-08 23:53:46,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:53:46,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:53:46,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:53:46,752 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:53:46,753 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:53:46,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label36.c [2025-01-08 23:53:47,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf771b0a1/a8a3d851b3194b7e932b2c7f1e287510/FLAG3b659410a [2025-01-08 23:53:48,373 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:53:48,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label36.c [2025-01-08 23:53:48,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf771b0a1/a8a3d851b3194b7e932b2c7f1e287510/FLAG3b659410a [2025-01-08 23:53:48,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf771b0a1/a8a3d851b3194b7e932b2c7f1e287510 [2025-01-08 23:53:48,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:53:48,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:53:48,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:53:48,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:53:48,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:53:48,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:53:48" (1/1) ... [2025-01-08 23:53:48,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c778e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:48, skipping insertion in model container [2025-01-08 23:53:48,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:53:48" (1/1) ... [2025-01-08 23:53:48,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:53:48,679 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/Problem13_label36.c[1933,1946] [2025-01-08 23:53:49,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:53:49,185 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:53:49,194 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/Problem13_label36.c[1933,1946] [2025-01-08 23:53:49,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:53:49,566 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:53:49,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:49 WrapperNode [2025-01-08 23:53:49,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:53:49,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:53:49,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:53:49,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:53:49,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:49" (1/1) ... [2025-01-08 23:53:49,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:49" (1/1) ... [2025-01-08 23:53:49,953 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:53:49,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:53:49,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:53:49,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:53:49,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:53:49,962 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:49" (1/1) ... [2025-01-08 23:53:49,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:49" (1/1) ... [2025-01-08 23:53:50,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:49" (1/1) ... [2025-01-08 23:53:50,263 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-08 23:53:50,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:49" (1/1) ... [2025-01-08 23:53:50,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:49" (1/1) ... [2025-01-08 23:53:50,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:49" (1/1) ... [2025-01-08 23:53:50,438 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:49" (1/1) ... [2025-01-08 23:53:50,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:49" (1/1) ... [2025-01-08 23:53:50,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:49" (1/1) ... [2025-01-08 23:53:50,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:49" (1/1) ... [2025-01-08 23:53:50,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:53:50,582 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:53:50,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:53:50,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:53:50,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:49" (1/1) ... [2025-01-08 23:53:50,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:53:50,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:53:50,608 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-08 23:53:50,615 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-08 23:53:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:53:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:53:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:53:50,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:53:50,680 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:53:50,681 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:53:54,498 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:53:54,499 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:53:54,536 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:53:54,536 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:53:54,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:53:54 BoogieIcfgContainer [2025-01-08 23:53:54,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:53:54,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:53:54,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:53:54,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:53:54,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:53:48" (1/3) ... [2025-01-08 23:53:54,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7ee1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:53:54, skipping insertion in model container [2025-01-08 23:53:54,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:49" (2/3) ... [2025-01-08 23:53:54,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7ee1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:53:54, skipping insertion in model container [2025-01-08 23:53:54,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:53:54" (3/3) ... [2025-01-08 23:53:54,545 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label36.c [2025-01-08 23:53:54,556 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:53:54,558 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label36.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:53:54,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:53:54,645 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;@14ef0dc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:53:54,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:53:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 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-08 23:53:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-08 23:53:54,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:54,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:53:54,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:54,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:54,662 INFO L85 PathProgramCache]: Analyzing trace with hash -955436260, now seen corresponding path program 1 times [2025-01-08 23:53:54,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:54,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559915372] [2025-01-08 23:53:54,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:54,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:54,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-08 23:53:54,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-08 23:53:54,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:54,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:54,848 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-08 23:53:54,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:54,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559915372] [2025-01-08 23:53:54,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559915372] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:54,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:54,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:53:54,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797707569] [2025-01-08 23:53:54,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:54,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:54,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:54,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:54,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:54,973 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 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-08 23:53:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:58,275 INFO L93 Difference]: Finished difference Result 3082 states and 5686 transitions. [2025-01-08 23:53:58,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:58,277 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-08 23:53:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:58,294 INFO L225 Difference]: With dead ends: 3082 [2025-01-08 23:53:58,297 INFO L226 Difference]: Without dead ends: 1899 [2025-01-08 23:53:58,304 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-08 23:53:58,306 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 1028 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:58,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 645 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:53:58,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-01-08 23:53:58,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1894. [2025-01-08 23:53:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.7374537770734284) internal successors, (3289), 1893 states have internal predecessors, (3289), 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-08 23:53:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3289 transitions. [2025-01-08 23:53:58,379 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3289 transitions. Word has length 11 [2025-01-08 23:53:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:58,379 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 3289 transitions. [2025-01-08 23:53:58,380 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-08 23:53:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3289 transitions. [2025-01-08 23:53:58,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-08 23:53:58,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:58,381 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-08 23:53:58,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:53:58,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:58,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:58,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1542769894, now seen corresponding path program 1 times [2025-01-08 23:53:58,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:58,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512529046] [2025-01-08 23:53:58,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:58,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:58,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-08 23:53:58,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-08 23:53:58,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:58,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:58,611 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-08 23:53:58,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:58,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512529046] [2025-01-08 23:53:58,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512529046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:58,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:58,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:53:58,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767029197] [2025-01-08 23:53:58,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:58,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:58,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:58,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:58,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:58,616 INFO L87 Difference]: Start difference. First operand 1894 states and 3289 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-08 23:54:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:02,056 INFO L93 Difference]: Finished difference Result 5384 states and 9441 transitions. [2025-01-08 23:54:02,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:02,057 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-08 23:54:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:02,066 INFO L225 Difference]: With dead ends: 5384 [2025-01-08 23:54:02,067 INFO L226 Difference]: Without dead ends: 3492 [2025-01-08 23:54:02,069 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-08 23:54:02,070 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 922 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:02,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1014 Invalid, 3189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-08 23:54:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2025-01-08 23:54:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 3491. [2025-01-08 23:54:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3491 states, 3490 states have (on average 1.5383954154727795) internal successors, (5369), 3490 states have internal predecessors, (5369), 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-08 23:54:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3491 states to 3491 states and 5369 transitions. [2025-01-08 23:54:02,117 INFO L78 Accepts]: Start accepts. Automaton has 3491 states and 5369 transitions. Word has length 76 [2025-01-08 23:54:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:02,117 INFO L471 AbstractCegarLoop]: Abstraction has 3491 states and 5369 transitions. [2025-01-08 23:54:02,117 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-08 23:54:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 5369 transitions. [2025-01-08 23:54:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-08 23:54:02,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:02,119 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-08 23:54:02,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:54:02,119 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:02,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:02,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1023759137, now seen corresponding path program 1 times [2025-01-08 23:54:02,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:02,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736053780] [2025-01-08 23:54:02,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:02,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:02,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-08 23:54:02,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-08 23:54:02,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:02,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:02,278 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-08 23:54:02,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:02,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736053780] [2025-01-08 23:54:02,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736053780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:02,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:02,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:54:02,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102766431] [2025-01-08 23:54:02,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:02,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:02,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:02,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:02,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:02,280 INFO L87 Difference]: Start difference. First operand 3491 states and 5369 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-08 23:54:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:05,157 INFO L93 Difference]: Finished difference Result 10207 states and 15787 transitions. [2025-01-08 23:54:05,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:05,158 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-08 23:54:05,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:05,184 INFO L225 Difference]: With dead ends: 10207 [2025-01-08 23:54:05,184 INFO L226 Difference]: Without dead ends: 6718 [2025-01-08 23:54:05,190 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-08 23:54:05,192 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3286 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 3646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 3286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:05,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1082 Invalid, 3646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 3286 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:54:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6718 states. [2025-01-08 23:54:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6718 to 6655. [2025-01-08 23:54:05,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6655 states, 6654 states have (on average 1.4174932371505862) internal successors, (9432), 6654 states have internal predecessors, (9432), 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-08 23:54:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6655 states to 6655 states and 9432 transitions. [2025-01-08 23:54:05,339 INFO L78 Accepts]: Start accepts. Automaton has 6655 states and 9432 transitions. Word has length 78 [2025-01-08 23:54:05,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:05,341 INFO L471 AbstractCegarLoop]: Abstraction has 6655 states and 9432 transitions. [2025-01-08 23:54:05,341 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-08 23:54:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 6655 states and 9432 transitions. [2025-01-08 23:54:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-08 23:54:05,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:05,342 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] [2025-01-08 23:54:05,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:54:05,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:05,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:05,343 INFO L85 PathProgramCache]: Analyzing trace with hash 30554788, now seen corresponding path program 1 times [2025-01-08 23:54:05,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:05,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886589995] [2025-01-08 23:54:05,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:05,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:05,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-08 23:54:05,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-08 23:54:05,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:05,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:05,459 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-08 23:54:05,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:05,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886589995] [2025-01-08 23:54:05,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886589995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:05,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:05,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:54:05,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904444529] [2025-01-08 23:54:05,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:05,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:05,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:05,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:05,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:05,460 INFO L87 Difference]: Start difference. First operand 6655 states and 9432 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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-08 23:54:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:08,060 INFO L93 Difference]: Finished difference Result 14106 states and 20657 transitions. [2025-01-08 23:54:08,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:08,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 80 [2025-01-08 23:54:08,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:08,078 INFO L225 Difference]: With dead ends: 14106 [2025-01-08 23:54:08,078 INFO L226 Difference]: Without dead ends: 7453 [2025-01-08 23:54:08,086 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-08 23:54:08,087 INFO L435 NwaCegarLoop]: 1088 mSDtfsCounter, 786 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 777 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 777 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:08,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1239 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [777 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:54:08,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states. [2025-01-08 23:54:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 7438. [2025-01-08 23:54:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7438 states, 7437 states have (on average 1.3155842409573753) internal successors, (9784), 7437 states have internal predecessors, (9784), 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-08 23:54:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7438 states to 7438 states and 9784 transitions. [2025-01-08 23:54:08,159 INFO L78 Accepts]: Start accepts. Automaton has 7438 states and 9784 transitions. Word has length 80 [2025-01-08 23:54:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:08,160 INFO L471 AbstractCegarLoop]: Abstraction has 7438 states and 9784 transitions. [2025-01-08 23:54:08,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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-08 23:54:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 7438 states and 9784 transitions. [2025-01-08 23:54:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-08 23:54:08,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:08,161 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] [2025-01-08 23:54:08,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:54:08,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:08,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:08,162 INFO L85 PathProgramCache]: Analyzing trace with hash 550237719, now seen corresponding path program 1 times [2025-01-08 23:54:08,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:08,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719713266] [2025-01-08 23:54:08,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:08,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:08,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-08 23:54:08,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-08 23:54:08,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:08,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:08,276 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-08 23:54:08,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:08,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719713266] [2025-01-08 23:54:08,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719713266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:08,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:08,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:54:08,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868303210] [2025-01-08 23:54:08,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:08,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:08,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:08,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:08,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:08,279 INFO L87 Difference]: Start difference. First operand 7438 states and 9784 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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-08 23:54:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:11,272 INFO L93 Difference]: Finished difference Result 19632 states and 26424 transitions. [2025-01-08 23:54:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:11,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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 97 [2025-01-08 23:54:11,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:11,320 INFO L225 Difference]: With dead ends: 19632 [2025-01-08 23:54:11,320 INFO L226 Difference]: Without dead ends: 12983 [2025-01-08 23:54:11,328 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-08 23:54:11,328 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 960 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 3303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:11,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 863 Invalid, 3303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:54:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12983 states. [2025-01-08 23:54:11,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12983 to 12972. [2025-01-08 23:54:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12972 states, 12971 states have (on average 1.2362963534037468) internal successors, (16036), 12971 states have internal predecessors, (16036), 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-08 23:54:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 16036 transitions. [2025-01-08 23:54:11,531 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 16036 transitions. Word has length 97 [2025-01-08 23:54:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:11,532 INFO L471 AbstractCegarLoop]: Abstraction has 12972 states and 16036 transitions. [2025-01-08 23:54:11,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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-08 23:54:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 16036 transitions. [2025-01-08 23:54:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-08 23:54:11,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:11,537 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, 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] [2025-01-08 23:54:11,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:54:11,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:11,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:11,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1407223791, now seen corresponding path program 1 times [2025-01-08 23:54:11,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:11,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919256381] [2025-01-08 23:54:11,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:11,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:11,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-08 23:54:11,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-08 23:54:11,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:11,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 23:54:11,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:11,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919256381] [2025-01-08 23:54:11,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919256381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:11,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:11,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:54:11,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637494366] [2025-01-08 23:54:11,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:11,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:11,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:11,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:11,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:11,951 INFO L87 Difference]: Start difference. First operand 12972 states and 16036 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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-08 23:54:14,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:14,163 INFO L93 Difference]: Finished difference Result 25155 states and 31273 transitions. [2025-01-08 23:54:14,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:14,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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 216 [2025-01-08 23:54:14,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:14,186 INFO L225 Difference]: With dead ends: 25155 [2025-01-08 23:54:14,186 INFO L226 Difference]: Without dead ends: 12972 [2025-01-08 23:54:14,197 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-08 23:54:14,198 INFO L435 NwaCegarLoop]: 1084 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:14,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1213 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:54:14,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12972 states. [2025-01-08 23:54:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12972 to 12972. [2025-01-08 23:54:14,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12972 states, 12971 states have (on average 1.235910878112713) internal successors, (16031), 12971 states have internal predecessors, (16031), 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-08 23:54:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 16031 transitions. [2025-01-08 23:54:14,371 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 16031 transitions. Word has length 216 [2025-01-08 23:54:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:14,372 INFO L471 AbstractCegarLoop]: Abstraction has 12972 states and 16031 transitions. [2025-01-08 23:54:14,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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-08 23:54:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 16031 transitions. [2025-01-08 23:54:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-08 23:54:14,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:14,374 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, 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] [2025-01-08 23:54:14,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:54:14,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:14,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash -300481643, now seen corresponding path program 1 times [2025-01-08 23:54:14,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:14,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512928248] [2025-01-08 23:54:14,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:14,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:14,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-08 23:54:14,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-08 23:54:14,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:14,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 87 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:54:14,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:14,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512928248] [2025-01-08 23:54:14,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512928248] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:54:14,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913410303] [2025-01-08 23:54:14,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:14,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:54:14,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:54:14,928 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-08 23:54:14,933 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-08 23:54:14,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-08 23:54:15,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-08 23:54:15,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:15,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:15,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:54:15,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:54:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:54:15,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:54:15,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913410303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:15,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:54:15,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:54:15,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720626220] [2025-01-08 23:54:15,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:15,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:15,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:15,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:15,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:54:15,322 INFO L87 Difference]: Start difference. First operand 12972 states and 16031 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-08 23:54:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:18,346 INFO L93 Difference]: Finished difference Result 32231 states and 40759 transitions. [2025-01-08 23:54:18,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:18,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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 223 [2025-01-08 23:54:18,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:18,376 INFO L225 Difference]: With dead ends: 32231 [2025-01-08 23:54:18,377 INFO L226 Difference]: Without dead ends: 22419 [2025-01-08 23:54:18,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:54:18,388 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 727 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 2506 mSolverCounterSat, 765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 765 IncrementalHoareTripleChecker+Valid, 2506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:18,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1189 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [765 Valid, 2506 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:54:18,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22419 states. [2025-01-08 23:54:18,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22419 to 22418. [2025-01-08 23:54:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22418 states, 22417 states have (on average 1.1692019449524915) internal successors, (26210), 22417 states have internal predecessors, (26210), 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-08 23:54:18,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22418 states to 22418 states and 26210 transitions. [2025-01-08 23:54:18,623 INFO L78 Accepts]: Start accepts. Automaton has 22418 states and 26210 transitions. Word has length 223 [2025-01-08 23:54:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:18,624 INFO L471 AbstractCegarLoop]: Abstraction has 22418 states and 26210 transitions. [2025-01-08 23:54:18,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-08 23:54:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 22418 states and 26210 transitions. [2025-01-08 23:54:18,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-08 23:54:18,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:18,629 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, 1, 1, 1, 1, 1, 1, 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-08 23:54:18,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 23:54:18,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:54:18,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:18,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash 932317707, now seen corresponding path program 1 times [2025-01-08 23:54:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:18,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49423460] [2025-01-08 23:54:18,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:18,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:18,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-08 23:54:18,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-08 23:54:18,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:18,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 23:54:18,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:18,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49423460] [2025-01-08 23:54:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49423460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:18,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:18,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:18,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951748100] [2025-01-08 23:54:18,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:18,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:18,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:18,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:18,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:18,940 INFO L87 Difference]: Start difference. First operand 22418 states and 26210 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-08 23:54:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:21,678 INFO L93 Difference]: Finished difference Result 55078 states and 65658 transitions. [2025-01-08 23:54:21,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:21,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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 247 [2025-01-08 23:54:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:21,723 INFO L225 Difference]: With dead ends: 55078 [2025-01-08 23:54:21,724 INFO L226 Difference]: Without dead ends: 33449 [2025-01-08 23:54:21,745 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-08 23:54:21,746 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 889 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 911 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 911 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:21,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 950 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [911 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:54:21,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33449 states. [2025-01-08 23:54:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33449 to 23182. [2025-01-08 23:54:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23182 states, 23181 states have (on average 1.1823907510461154) internal successors, (27409), 23181 states have internal predecessors, (27409), 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-08 23:54:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23182 states to 23182 states and 27409 transitions. [2025-01-08 23:54:21,987 INFO L78 Accepts]: Start accepts. Automaton has 23182 states and 27409 transitions. Word has length 247 [2025-01-08 23:54:21,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:21,987 INFO L471 AbstractCegarLoop]: Abstraction has 23182 states and 27409 transitions. [2025-01-08 23:54:21,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-08 23:54:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 23182 states and 27409 transitions. [2025-01-08 23:54:21,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-08 23:54:21,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:21,992 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:21,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:54:21,993 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:21,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:21,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1484151199, now seen corresponding path program 1 times [2025-01-08 23:54:21,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:21,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250365471] [2025-01-08 23:54:21,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:21,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:22,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-08 23:54:22,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-08 23:54:22,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:22,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 23:54:22,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:22,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250365471] [2025-01-08 23:54:22,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250365471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:22,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:22,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:22,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930788210] [2025-01-08 23:54:22,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:22,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:54:22,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:22,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:54:22,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:54:22,240 INFO L87 Difference]: Start difference. First operand 23182 states and 27409 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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-08 23:54:27,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:27,800 INFO L93 Difference]: Finished difference Result 86714 states and 103287 transitions. [2025-01-08 23:54:27,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:54:27,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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 299 [2025-01-08 23:54:27,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:27,871 INFO L225 Difference]: With dead ends: 86714 [2025-01-08 23:54:27,871 INFO L226 Difference]: Without dead ends: 64321 [2025-01-08 23:54:27,900 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-08 23:54:27,901 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 1718 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 6352 mSolverCounterSat, 1052 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 7404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1052 IncrementalHoareTripleChecker+Valid, 6352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:27,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 1032 Invalid, 7404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1052 Valid, 6352 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-01-08 23:54:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64321 states. [2025-01-08 23:54:28,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64321 to 63414. [2025-01-08 23:54:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63414 states, 63413 states have (on average 1.1583271568921198) internal successors, (73453), 63413 states have internal predecessors, (73453), 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-08 23:54:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63414 states to 63414 states and 73453 transitions. [2025-01-08 23:54:28,460 INFO L78 Accepts]: Start accepts. Automaton has 63414 states and 73453 transitions. Word has length 299 [2025-01-08 23:54:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:28,462 INFO L471 AbstractCegarLoop]: Abstraction has 63414 states and 73453 transitions. [2025-01-08 23:54:28,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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-08 23:54:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 63414 states and 73453 transitions. [2025-01-08 23:54:28,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-01-08 23:54:28,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:28,464 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, 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-08 23:54:28,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:54:28,465 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:28,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:28,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1818709692, now seen corresponding path program 1 times [2025-01-08 23:54:28,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:28,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184164531] [2025-01-08 23:54:28,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:28,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:28,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-01-08 23:54:28,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-01-08 23:54:28,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:28,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:29,450 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 146 proven. 113 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 23:54:29,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:29,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184164531] [2025-01-08 23:54:29,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184164531] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:54:29,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564231463] [2025-01-08 23:54:29,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:29,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:54:29,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:54:29,454 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-08 23:54:29,455 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-08 23:54:29,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-01-08 23:54:29,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-01-08 23:54:29,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:29,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:29,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:54:29,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:54:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-08 23:54:29,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:54:29,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564231463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:29,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:54:29,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-08 23:54:29,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061082647] [2025-01-08 23:54:29,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:29,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:29,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:29,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:29,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:54:29,668 INFO L87 Difference]: Start difference. First operand 63414 states and 73453 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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-08 23:54:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:32,505 INFO L93 Difference]: Finished difference Result 174211 states and 202885 transitions. [2025-01-08 23:54:32,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:32,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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 317 [2025-01-08 23:54:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:32,638 INFO L225 Difference]: With dead ends: 174211 [2025-01-08 23:54:32,638 INFO L226 Difference]: Without dead ends: 111586 [2025-01-08 23:54:32,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:54:32,688 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 1077 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 2636 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 2636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:32,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 926 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 2636 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:54:32,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111586 states. [2025-01-08 23:54:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111586 to 111555. [2025-01-08 23:54:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111555 states, 111554 states have (on average 1.1385338042562347) internal successors, (127008), 111554 states have internal predecessors, (127008), 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-08 23:54:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111555 states to 111555 states and 127008 transitions. [2025-01-08 23:54:34,163 INFO L78 Accepts]: Start accepts. Automaton has 111555 states and 127008 transitions. Word has length 317 [2025-01-08 23:54:34,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:34,164 INFO L471 AbstractCegarLoop]: Abstraction has 111555 states and 127008 transitions. [2025-01-08 23:54:34,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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-08 23:54:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 111555 states and 127008 transitions. [2025-01-08 23:54:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-08 23:54:34,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:34,167 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, 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] [2025-01-08 23:54:34,173 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-08 23:54:34,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:54:34,368 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:34,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash 159153176, now seen corresponding path program 1 times [2025-01-08 23:54:34,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:34,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951597572] [2025-01-08 23:54:34,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:34,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:34,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-08 23:54:34,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-08 23:54:34,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:34,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-08 23:54:34,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:34,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951597572] [2025-01-08 23:54:34,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951597572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:34,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:34,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:34,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979561325] [2025-01-08 23:54:34,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:34,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:34,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:34,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:34,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:34,744 INFO L87 Difference]: Start difference. First operand 111555 states and 127008 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-08 23:54:38,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:38,284 INFO L93 Difference]: Finished difference Result 231751 states and 266594 transitions. [2025-01-08 23:54:38,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:38,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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 326 [2025-01-08 23:54:38,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:38,589 INFO L225 Difference]: With dead ends: 231751 [2025-01-08 23:54:38,589 INFO L226 Difference]: Without dead ends: 120985 [2025-01-08 23:54:38,628 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-08 23:54:38,633 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 1155 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2405 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:38,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1560 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2405 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:54:38,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120985 states. [2025-01-08 23:54:39,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120985 to 118621. [2025-01-08 23:54:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118621 states, 118620 states have (on average 1.120215815208228) internal successors, (132880), 118620 states have internal predecessors, (132880), 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-08 23:54:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118621 states to 118621 states and 132880 transitions. [2025-01-08 23:54:39,830 INFO L78 Accepts]: Start accepts. Automaton has 118621 states and 132880 transitions. Word has length 326 [2025-01-08 23:54:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:39,831 INFO L471 AbstractCegarLoop]: Abstraction has 118621 states and 132880 transitions. [2025-01-08 23:54:39,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-08 23:54:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 118621 states and 132880 transitions. [2025-01-08 23:54:39,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-01-08 23:54:39,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:39,841 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:39,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:54:39,841 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:39,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:39,841 INFO L85 PathProgramCache]: Analyzing trace with hash -942634571, now seen corresponding path program 1 times [2025-01-08 23:54:39,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:39,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180390626] [2025-01-08 23:54:39,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:39,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:39,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-01-08 23:54:39,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-01-08 23:54:39,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:39,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-01-08 23:54:40,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:40,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180390626] [2025-01-08 23:54:40,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180390626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:40,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:40,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:40,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785187904] [2025-01-08 23:54:40,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:40,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:40,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:40,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:40,227 INFO L87 Difference]: Start difference. First operand 118621 states and 132880 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-08 23:54:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:43,609 INFO L93 Difference]: Finished difference Result 269512 states and 304326 transitions. [2025-01-08 23:54:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:43,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 367 [2025-01-08 23:54:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:43,801 INFO L225 Difference]: With dead ends: 269512 [2025-01-08 23:54:43,801 INFO L226 Difference]: Without dead ends: 151680 [2025-01-08 23:54:43,871 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-08 23:54:43,871 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 911 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 965 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 3372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 965 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:43,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 855 Invalid, 3372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [965 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:54:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151680 states. [2025-01-08 23:54:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151680 to 148510. [2025-01-08 23:54:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148510 states, 148509 states have (on average 1.1139459561373384) internal successors, (165431), 148509 states have internal predecessors, (165431), 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-08 23:54:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148510 states to 148510 states and 165431 transitions. [2025-01-08 23:54:45,543 INFO L78 Accepts]: Start accepts. Automaton has 148510 states and 165431 transitions. Word has length 367 [2025-01-08 23:54:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:45,543 INFO L471 AbstractCegarLoop]: Abstraction has 148510 states and 165431 transitions. [2025-01-08 23:54:45,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-08 23:54:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 148510 states and 165431 transitions. [2025-01-08 23:54:45,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-01-08 23:54:45,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:45,552 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:54:45,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:54:45,552 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:45,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:45,552 INFO L85 PathProgramCache]: Analyzing trace with hash -646450576, now seen corresponding path program 1 times [2025-01-08 23:54:45,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:45,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240067293] [2025-01-08 23:54:45,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:45,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:45,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-01-08 23:54:45,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-01-08 23:54:45,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:45,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:54:45,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:45,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240067293] [2025-01-08 23:54:45,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240067293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:45,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:45,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:45,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238481694] [2025-01-08 23:54:45,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:45,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:45,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:45,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:45,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:45,968 INFO L87 Difference]: Start difference. First operand 148510 states and 165431 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-08 23:54:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:49,284 INFO L93 Difference]: Finished difference Result 325360 states and 364607 transitions. [2025-01-08 23:54:49,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:49,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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 405 [2025-01-08 23:54:49,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:49,465 INFO L225 Difference]: With dead ends: 325360 [2025-01-08 23:54:49,465 INFO L226 Difference]: Without dead ends: 177639 [2025-01-08 23:54:49,506 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-08 23:54:49,506 INFO L435 NwaCegarLoop]: 1771 mSDtfsCounter, 779 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2543 mSolverCounterSat, 702 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 3245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 702 IncrementalHoareTripleChecker+Valid, 2543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:49,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1915 Invalid, 3245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [702 Valid, 2543 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:54:49,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177639 states. [2025-01-08 23:54:50,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177639 to 172107. [2025-01-08 23:54:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172107 states, 172106 states have (on average 1.0979977455754013) internal successors, (188972), 172106 states have internal predecessors, (188972), 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-08 23:54:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172107 states to 172107 states and 188972 transitions. [2025-01-08 23:54:51,320 INFO L78 Accepts]: Start accepts. Automaton has 172107 states and 188972 transitions. Word has length 405 [2025-01-08 23:54:51,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:51,321 INFO L471 AbstractCegarLoop]: Abstraction has 172107 states and 188972 transitions. [2025-01-08 23:54:51,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-08 23:54:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 172107 states and 188972 transitions. [2025-01-08 23:54:51,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-01-08 23:54:51,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:51,352 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:54:51,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:54:51,352 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:51,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:51,353 INFO L85 PathProgramCache]: Analyzing trace with hash 560437980, now seen corresponding path program 1 times [2025-01-08 23:54:51,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:51,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362421264] [2025-01-08 23:54:51,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:51,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:51,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-08 23:54:51,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-08 23:54:51,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:51,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:53,052 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 258 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 23:54:53,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:53,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362421264] [2025-01-08 23:54:53,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362421264] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:54:53,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384550470] [2025-01-08 23:54:53,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:53,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:54:53,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:54:53,054 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-08 23:54:53,057 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-08 23:54:53,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-01-08 23:54:53,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-01-08 23:54:53,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:53,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:53,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:54:53,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:54:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-08 23:54:53,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:54:53,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384550470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:53,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:54:53,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-08 23:54:53,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343839518] [2025-01-08 23:54:53,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:53,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:53,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:53,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:53,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:54:53,943 INFO L87 Difference]: Start difference. First operand 172107 states and 188972 transitions. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 2 states have internal predecessors, (474), 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-08 23:54:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:57,244 INFO L93 Difference]: Finished difference Result 348955 states and 382947 transitions. [2025-01-08 23:54:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:57,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 2 states have internal predecessors, (474), 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 594 [2025-01-08 23:54:57,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:57,424 INFO L225 Difference]: With dead ends: 348955 [2025-01-08 23:54:57,425 INFO L226 Difference]: Without dead ends: 177637 [2025-01-08 23:54:57,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:54:57,496 INFO L435 NwaCegarLoop]: 1019 mSDtfsCounter, 681 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 2564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:57,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 1149 Invalid, 2564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2455 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:54:57,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177637 states. [2025-01-08 23:54:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177637 to 176050. [2025-01-08 23:54:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176050 states, 176049 states have (on average 1.0968253156791574) internal successors, (193095), 176049 states have internal predecessors, (193095), 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-08 23:54:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176050 states to 176050 states and 193095 transitions. [2025-01-08 23:54:59,326 INFO L78 Accepts]: Start accepts. Automaton has 176050 states and 193095 transitions. Word has length 594 [2025-01-08 23:54:59,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:59,326 INFO L471 AbstractCegarLoop]: Abstraction has 176050 states and 193095 transitions. [2025-01-08 23:54:59,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 2 states have internal predecessors, (474), 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-08 23:54:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 176050 states and 193095 transitions. [2025-01-08 23:54:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-01-08 23:54:59,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:59,354 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, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:54:59,360 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-08 23:54:59,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:54:59,559 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:59,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:59,560 INFO L85 PathProgramCache]: Analyzing trace with hash -231509429, now seen corresponding path program 1 times [2025-01-08 23:54:59,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:59,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203198250] [2025-01-08 23:54:59,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:59,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:59,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-01-08 23:54:59,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-01-08 23:54:59,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:59,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-01-08 23:55:00,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:00,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203198250] [2025-01-08 23:55:00,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203198250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:00,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:00,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:00,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956165015] [2025-01-08 23:55:00,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:00,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:00,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:00,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:00,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:00,263 INFO L87 Difference]: Start difference. First operand 176050 states and 193095 transitions. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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-08 23:55:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:04,638 INFO L93 Difference]: Finished difference Result 440445 states and 484520 transitions. [2025-01-08 23:55:04,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:04,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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 597 [2025-01-08 23:55:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:04,966 INFO L225 Difference]: With dead ends: 440445 [2025-01-08 23:55:04,966 INFO L226 Difference]: Without dead ends: 265184 [2025-01-08 23:55:05,056 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-08 23:55:05,058 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 843 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 3043 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 3610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 3043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:05,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 902 Invalid, 3610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 3043 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-08 23:55:05,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265184 states. [2025-01-08 23:55:07,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265184 to 260329. [2025-01-08 23:55:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260329 states, 260328 states have (on average 1.0917573215328356) internal successors, (284215), 260328 states have internal predecessors, (284215), 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-08 23:55:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260329 states to 260329 states and 284215 transitions. [2025-01-08 23:55:07,792 INFO L78 Accepts]: Start accepts. Automaton has 260329 states and 284215 transitions. Word has length 597 [2025-01-08 23:55:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:07,793 INFO L471 AbstractCegarLoop]: Abstraction has 260329 states and 284215 transitions. [2025-01-08 23:55:07,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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-08 23:55:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 260329 states and 284215 transitions. [2025-01-08 23:55:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2025-01-08 23:55:07,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:07,812 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, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-08 23:55:07,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:55:07,812 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:07,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:07,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1715572237, now seen corresponding path program 1 times [2025-01-08 23:55:07,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:07,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681449050] [2025-01-08 23:55:07,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:07,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:07,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 618 statements into 1 equivalence classes. [2025-01-08 23:55:08,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 618 of 618 statements. [2025-01-08 23:55:08,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:08,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 596 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-01-08 23:55:08,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:08,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681449050] [2025-01-08 23:55:08,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681449050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:08,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:08,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:08,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389691791] [2025-01-08 23:55:08,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:08,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:08,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:08,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:08,238 INFO L87 Difference]: Start difference. First operand 260329 states and 284215 transitions. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-08 23:55:12,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:12,004 INFO L93 Difference]: Finished difference Result 486619 states and 530313 transitions. [2025-01-08 23:55:12,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:12,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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 618 [2025-01-08 23:55:12,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:12,235 INFO L225 Difference]: With dead ends: 486619 [2025-01-08 23:55:12,235 INFO L226 Difference]: Without dead ends: 209756 [2025-01-08 23:55:12,269 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-08 23:55:12,269 INFO L435 NwaCegarLoop]: 1483 mSDtfsCounter, 1001 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 588 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 588 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:12,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 1611 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [588 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:55:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209756 states. [2025-01-08 23:55:13,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209756 to 203449. [2025-01-08 23:55:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203449 states, 203448 states have (on average 1.0575232983366758) internal successors, (215151), 203448 states have internal predecessors, (215151), 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-08 23:55:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203449 states to 203449 states and 215151 transitions. [2025-01-08 23:55:14,132 INFO L78 Accepts]: Start accepts. Automaton has 203449 states and 215151 transitions. Word has length 618 [2025-01-08 23:55:14,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:14,132 INFO L471 AbstractCegarLoop]: Abstraction has 203449 states and 215151 transitions. [2025-01-08 23:55:14,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-08 23:55:14,132 INFO L276 IsEmpty]: Start isEmpty. Operand 203449 states and 215151 transitions. [2025-01-08 23:55:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-01-08 23:55:14,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:14,434 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:55:14,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:55:14,434 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:14,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:14,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2075442609, now seen corresponding path program 1 times [2025-01-08 23:55:14,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:14,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12889751] [2025-01-08 23:55:14,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:14,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:14,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-01-08 23:55:14,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-01-08 23:55:14,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:14,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat