./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label11.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/Problem18_label11.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 ee9b5fdd674726fda67e17570bcafe668da2440128a5d9da4a9084c95b04c368 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:17:27,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:17:27,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:17:27,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:17:27,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:17:27,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:17:27,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:17:27,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:17:27,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:17:27,355 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:17:27,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:17:27,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:17:27,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:17:27,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:17:27,357 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:17:27,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:17:27,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:17:27,357 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:17:27,358 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:17:27,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:17:27,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:17:27,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:17:27,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:17:27,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:17:27,358 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:17:27,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:17:27,358 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:17:27,358 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:17:27,358 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:17:27,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:17:27,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:17:27,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:17:27,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:17:27,359 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:17:27,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:17:27,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:17:27,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:17:27,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:17:27,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:17:27,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:17:27,360 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:17:27,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:17:27,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:17:27,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:17:27,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:17:27,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:17:27,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:17:27,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:17:27,360 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 -> ee9b5fdd674726fda67e17570bcafe668da2440128a5d9da4a9084c95b04c368 [2025-01-09 00:17:27,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:17:27,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:17:27,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:17:27,574 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:17:27,575 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:17:27,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label11.c [2025-01-09 00:17:28,683 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d485461ce/6bd5db9187844d8eaa867a55706e2530/FLAG8bb766f2e [2025-01-09 00:17:29,105 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:17:29,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label11.c [2025-01-09 00:17:29,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d485461ce/6bd5db9187844d8eaa867a55706e2530/FLAG8bb766f2e [2025-01-09 00:17:29,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d485461ce/6bd5db9187844d8eaa867a55706e2530 [2025-01-09 00:17:29,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:17:29,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:17:29,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:17:29,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:17:29,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:17:29,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:17:29" (1/1) ... [2025-01-09 00:17:29,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474ef4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29, skipping insertion in model container [2025-01-09 00:17:29,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:17:29" (1/1) ... [2025-01-09 00:17:29,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:17:29,438 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/Problem18_label11.c[4550,4563] [2025-01-09 00:17:29,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:17:29,763 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:17:29,800 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/Problem18_label11.c[4550,4563] [2025-01-09 00:17:29,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:17:29,980 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:17:29,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29 WrapperNode [2025-01-09 00:17:29,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:17:29,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:17:29,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:17:29,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:17:29,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29" (1/1) ... [2025-01-09 00:17:30,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29" (1/1) ... [2025-01-09 00:17:30,168 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-01-09 00:17:30,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:17:30,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:17:30,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:17:30,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:17:30,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29" (1/1) ... [2025-01-09 00:17:30,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29" (1/1) ... [2025-01-09 00:17:30,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29" (1/1) ... [2025-01-09 00:17:30,280 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:17:30,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29" (1/1) ... [2025-01-09 00:17:30,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29" (1/1) ... [2025-01-09 00:17:30,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29" (1/1) ... [2025-01-09 00:17:30,337 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29" (1/1) ... [2025-01-09 00:17:30,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29" (1/1) ... [2025-01-09 00:17:30,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29" (1/1) ... [2025-01-09 00:17:30,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29" (1/1) ... [2025-01-09 00:17:30,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:17:30,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:17:30,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:17:30,403 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:17:30,404 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29" (1/1) ... [2025-01-09 00:17:30,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:17:30,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:17:30,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:17:30,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:17:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:17:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:17:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:17:30,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:17:30,527 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:17:30,528 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:17:33,062 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-01-09 00:17:33,062 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:17:33,092 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:17:33,092 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:17:33,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:17:33 BoogieIcfgContainer [2025-01-09 00:17:33,093 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:17:33,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:17:33,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:17:33,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:17:33,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:17:29" (1/3) ... [2025-01-09 00:17:33,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a38522f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:17:33, skipping insertion in model container [2025-01-09 00:17:33,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:17:29" (2/3) ... [2025-01-09 00:17:33,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a38522f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:17:33, skipping insertion in model container [2025-01-09 00:17:33,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:17:33" (3/3) ... [2025-01-09 00:17:33,100 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label11.c [2025-01-09 00:17:33,111 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:17:33,113 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label11.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:17:33,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:17:33,185 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;@679b23e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:17:33,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:17:33,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 00:17:33,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:33,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:17:33,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:33,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:33,203 INFO L85 PathProgramCache]: Analyzing trace with hash -760678, now seen corresponding path program 1 times [2025-01-09 00:17:33,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:33,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521703151] [2025-01-09 00:17:33,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:33,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:33,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 00:17:33,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 00:17:33,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:33,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:17:33,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:33,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521703151] [2025-01-09 00:17:33,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521703151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:33,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:33,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:17:33,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523464684] [2025-01-09 00:17:33,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:33,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:17:33,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:33,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:17:33,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:17:33,570 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 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 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:37,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:37,825 INFO L93 Difference]: Finished difference Result 2900 states and 5644 transitions. [2025-01-09 00:17:37,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:17:37,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2025-01-09 00:17:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:37,841 INFO L225 Difference]: With dead ends: 2900 [2025-01-09 00:17:37,841 INFO L226 Difference]: Without dead ends: 2074 [2025-01-09 00:17:37,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:17:37,847 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 2022 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5262 mSolverCounterSat, 1069 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2022 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 6331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1069 IncrementalHoareTripleChecker+Valid, 5262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:37,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2022 Valid, 712 Invalid, 6331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1069 Valid, 5262 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 00:17:37,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2025-01-09 00:17:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2025-01-09 00:17:37,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 2073 states have (on average 1.5533043897732755) internal successors, (3220), 2073 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3220 transitions. [2025-01-09 00:17:37,945 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3220 transitions. Word has length 42 [2025-01-09 00:17:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:37,945 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 3220 transitions. [2025-01-09 00:17:37,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3220 transitions. [2025-01-09 00:17:37,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 00:17:37,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:37,950 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:17:37,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:17:37,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:37,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:37,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1435494305, now seen corresponding path program 1 times [2025-01-09 00:17:37,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:37,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986073584] [2025-01-09 00:17:37,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:37,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:37,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 00:17:37,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 00:17:37,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:37,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:17:38,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:38,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986073584] [2025-01-09 00:17:38,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986073584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:38,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:38,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:17:38,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863062788] [2025-01-09 00:17:38,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:38,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:17:38,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:38,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:17:38,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:17:38,403 INFO L87 Difference]: Start difference. First operand 2074 states and 3220 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:41,478 INFO L93 Difference]: Finished difference Result 6906 states and 10855 transitions. [2025-01-09 00:17:41,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:17:41,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 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 135 [2025-01-09 00:17:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:41,490 INFO L225 Difference]: With dead ends: 6906 [2025-01-09 00:17:41,491 INFO L226 Difference]: Without dead ends: 4834 [2025-01-09 00:17:41,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:17:41,493 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 1923 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4378 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 5000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 4378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:41,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 647 Invalid, 5000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 4378 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 00:17:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2025-01-09 00:17:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4144. [2025-01-09 00:17:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 1.3376780111030655) internal successors, (5542), 4143 states have internal predecessors, (5542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:41,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5542 transitions. [2025-01-09 00:17:41,551 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5542 transitions. Word has length 135 [2025-01-09 00:17:41,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:41,552 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5542 transitions. [2025-01-09 00:17:41,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5542 transitions. [2025-01-09 00:17:41,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 00:17:41,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:41,563 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:17:41,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:17:41,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:41,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:41,564 INFO L85 PathProgramCache]: Analyzing trace with hash -70144639, now seen corresponding path program 1 times [2025-01-09 00:17:41,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:41,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515010336] [2025-01-09 00:17:41,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:41,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:41,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 00:17:41,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 00:17:41,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:41,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-09 00:17:41,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:41,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515010336] [2025-01-09 00:17:41,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515010336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:41,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:41,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:17:41,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766305387] [2025-01-09 00:17:41,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:41,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:17:41,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:41,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:17:41,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:41,786 INFO L87 Difference]: Start difference. First operand 4144 states and 5542 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:43,532 INFO L93 Difference]: Finished difference Result 9666 states and 13597 transitions. [2025-01-09 00:17:43,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:17:43,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 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 224 [2025-01-09 00:17:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:43,548 INFO L225 Difference]: With dead ends: 9666 [2025-01-09 00:17:43,548 INFO L226 Difference]: Without dead ends: 5524 [2025-01-09 00:17:43,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:43,552 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 590 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:43,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 435 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:17:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2025-01-09 00:17:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 5524. [2025-01-09 00:17:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5523 states have (on average 1.320659062103929) internal successors, (7294), 5523 states have internal predecessors, (7294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 7294 transitions. [2025-01-09 00:17:43,623 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 7294 transitions. Word has length 224 [2025-01-09 00:17:43,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:43,624 INFO L471 AbstractCegarLoop]: Abstraction has 5524 states and 7294 transitions. [2025-01-09 00:17:43,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:43,625 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 7294 transitions. [2025-01-09 00:17:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-01-09 00:17:43,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:43,628 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:17:43,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:17:43,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:43,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:43,630 INFO L85 PathProgramCache]: Analyzing trace with hash -162277484, now seen corresponding path program 1 times [2025-01-09 00:17:43,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:43,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857707947] [2025-01-09 00:17:43,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:43,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:43,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 00:17:43,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 00:17:43,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:43,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:17:43,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:43,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857707947] [2025-01-09 00:17:43,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857707947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:43,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:43,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:17:43,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267575561] [2025-01-09 00:17:43,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:43,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:17:43,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:43,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:17:43,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:17:43,941 INFO L87 Difference]: Start difference. First operand 5524 states and 7294 transitions. Second operand has 4 states, 4 states have (on average 73.25) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:45,717 INFO L93 Difference]: Finished difference Result 13169 states and 17027 transitions. [2025-01-09 00:17:45,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:17:45,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 3 states have internal predecessors, (293), 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 293 [2025-01-09 00:17:45,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:45,733 INFO L225 Difference]: With dead ends: 13169 [2025-01-09 00:17:45,734 INFO L226 Difference]: Without dead ends: 7594 [2025-01-09 00:17:45,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:17:45,740 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 529 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 3139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:45,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 636 Invalid, 3139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:17:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7594 states. [2025-01-09 00:17:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7594 to 6904. [2025-01-09 00:17:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6903 states have (on average 1.206431986093003) internal successors, (8328), 6903 states have internal predecessors, (8328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 8328 transitions. [2025-01-09 00:17:45,823 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 8328 transitions. Word has length 293 [2025-01-09 00:17:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:45,824 INFO L471 AbstractCegarLoop]: Abstraction has 6904 states and 8328 transitions. [2025-01-09 00:17:45,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:45,825 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 8328 transitions. [2025-01-09 00:17:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2025-01-09 00:17:45,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:45,841 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:17:45,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:17:45,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:45,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1168691013, now seen corresponding path program 1 times [2025-01-09 00:17:45,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:45,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897494188] [2025-01-09 00:17:45,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:45,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:45,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 922 statements into 1 equivalence classes. [2025-01-09 00:17:45,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 922 of 922 statements. [2025-01-09 00:17:45,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:45,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:46,529 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-09 00:17:46,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:46,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897494188] [2025-01-09 00:17:46,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897494188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:46,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:46,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:17:46,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668467008] [2025-01-09 00:17:46,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:46,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:17:46,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:46,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:17:46,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:46,532 INFO L87 Difference]: Start difference. First operand 6904 states and 8328 transitions. Second operand has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:48,122 INFO L93 Difference]: Finished difference Result 17946 states and 22074 transitions. [2025-01-09 00:17:48,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:17:48,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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 922 [2025-01-09 00:17:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:48,153 INFO L225 Difference]: With dead ends: 17946 [2025-01-09 00:17:48,153 INFO L226 Difference]: Without dead ends: 11044 [2025-01-09 00:17:48,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:48,160 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 641 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:48,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 776 Invalid, 2427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:17:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11044 states. [2025-01-09 00:17:48,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11044 to 11044. [2025-01-09 00:17:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11044 states, 11043 states have (on average 1.2235805487639229) internal successors, (13512), 11043 states have internal predecessors, (13512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11044 states to 11044 states and 13512 transitions. [2025-01-09 00:17:48,280 INFO L78 Accepts]: Start accepts. Automaton has 11044 states and 13512 transitions. Word has length 922 [2025-01-09 00:17:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:48,281 INFO L471 AbstractCegarLoop]: Abstraction has 11044 states and 13512 transitions. [2025-01-09 00:17:48,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 11044 states and 13512 transitions. [2025-01-09 00:17:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 926 [2025-01-09 00:17:48,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:48,297 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:17:48,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:17:48,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:48,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:48,298 INFO L85 PathProgramCache]: Analyzing trace with hash 998658691, now seen corresponding path program 1 times [2025-01-09 00:17:48,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:48,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380858940] [2025-01-09 00:17:48,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:48,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:48,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 925 statements into 1 equivalence classes. [2025-01-09 00:17:48,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 925 of 925 statements. [2025-01-09 00:17:48,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:48,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 119 proven. 6 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2025-01-09 00:17:49,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:49,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380858940] [2025-01-09 00:17:49,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380858940] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:17:49,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649169485] [2025-01-09 00:17:49,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:49,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:17:49,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:17:49,252 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:17:49,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:17:49,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 925 statements into 1 equivalence classes. [2025-01-09 00:17:49,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 925 of 925 statements. [2025-01-09 00:17:49,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:49,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:49,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:17:49,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:17:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 00:17:50,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:17:50,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649169485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:50,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:17:50,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-09 00:17:50,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515648270] [2025-01-09 00:17:50,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:50,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:17:50,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:50,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:17:50,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:17:50,305 INFO L87 Difference]: Start difference. First operand 11044 states and 13512 transitions. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 2 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:51,906 INFO L93 Difference]: Finished difference Result 28296 states and 35483 transitions. [2025-01-09 00:17:51,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:17:51,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 2 states have internal predecessors, (560), 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 925 [2025-01-09 00:17:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:51,934 INFO L225 Difference]: With dead ends: 28296 [2025-01-09 00:17:51,934 INFO L226 Difference]: Without dead ends: 17254 [2025-01-09 00:17:51,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:17:51,945 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 227 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:51,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 388 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:17:51,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17254 states. [2025-01-09 00:17:52,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17254 to 15184. [2025-01-09 00:17:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15184 states, 15183 states have (on average 1.1843509187907528) internal successors, (17982), 15183 states have internal predecessors, (17982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15184 states to 15184 states and 17982 transitions. [2025-01-09 00:17:52,167 INFO L78 Accepts]: Start accepts. Automaton has 15184 states and 17982 transitions. Word has length 925 [2025-01-09 00:17:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:52,169 INFO L471 AbstractCegarLoop]: Abstraction has 15184 states and 17982 transitions. [2025-01-09 00:17:52,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 2 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 15184 states and 17982 transitions. [2025-01-09 00:17:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 950 [2025-01-09 00:17:52,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:52,183 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:17:52,190 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-09 00:17:52,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:17:52,384 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:52,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:52,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1638056647, now seen corresponding path program 1 times [2025-01-09 00:17:52,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:52,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98207536] [2025-01-09 00:17:52,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:52,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:52,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 949 statements into 1 equivalence classes. [2025-01-09 00:17:52,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 949 of 949 statements. [2025-01-09 00:17:52,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:52,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-09 00:17:53,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:53,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98207536] [2025-01-09 00:17:53,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98207536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:53,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:53,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:17:53,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812168541] [2025-01-09 00:17:53,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:53,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:17:53,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:53,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:17:53,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:53,134 INFO L87 Difference]: Start difference. First operand 15184 states and 17982 transitions. Second operand has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:54,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:54,630 INFO L93 Difference]: Finished difference Result 36576 states and 43378 transitions. [2025-01-09 00:17:54,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:17:54,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 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 949 [2025-01-09 00:17:54,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:54,666 INFO L225 Difference]: With dead ends: 36576 [2025-01-09 00:17:54,667 INFO L226 Difference]: Without dead ends: 21394 [2025-01-09 00:17:54,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:54,681 INFO L435 NwaCegarLoop]: 1085 mSDtfsCounter, 600 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 2051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:54,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1091 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 2051 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:17:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21394 states. [2025-01-09 00:17:54,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21394 to 20704. [2025-01-09 00:17:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20704 states, 20703 states have (on average 1.1628749456600493) internal successors, (24075), 20703 states have internal predecessors, (24075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20704 states to 20704 states and 24075 transitions. [2025-01-09 00:17:54,905 INFO L78 Accepts]: Start accepts. Automaton has 20704 states and 24075 transitions. Word has length 949 [2025-01-09 00:17:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:54,906 INFO L471 AbstractCegarLoop]: Abstraction has 20704 states and 24075 transitions. [2025-01-09 00:17:54,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 20704 states and 24075 transitions. [2025-01-09 00:17:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2025-01-09 00:17:54,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:54,913 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:17:54,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:17:54,913 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:54,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:54,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1925544853, now seen corresponding path program 1 times [2025-01-09 00:17:54,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:54,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4341257] [2025-01-09 00:17:54,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:54,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:54,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 954 statements into 1 equivalence classes. [2025-01-09 00:17:54,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 954 of 954 statements. [2025-01-09 00:17:54,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:54,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2025-01-09 00:17:55,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:55,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4341257] [2025-01-09 00:17:55,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4341257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:55,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:55,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:17:55,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740703497] [2025-01-09 00:17:55,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:55,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:17:55,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:55,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:17:55,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:55,258 INFO L87 Difference]: Start difference. First operand 20704 states and 24075 transitions. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 2 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:56,894 INFO L93 Difference]: Finished difference Result 48306 states and 56276 transitions. [2025-01-09 00:17:56,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:17:56,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 2 states have internal predecessors, (560), 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 954 [2025-01-09 00:17:56,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:56,927 INFO L225 Difference]: With dead ends: 48306 [2025-01-09 00:17:56,928 INFO L226 Difference]: Without dead ends: 27604 [2025-01-09 00:17:56,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:56,946 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 249 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:56,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 77 Invalid, 2479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:17:56,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27604 states. [2025-01-09 00:17:57,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27604 to 27604. [2025-01-09 00:17:57,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27604 states, 27603 states have (on average 1.1440785421874433) internal successors, (31580), 27603 states have internal predecessors, (31580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27604 states to 27604 states and 31580 transitions. [2025-01-09 00:17:57,183 INFO L78 Accepts]: Start accepts. Automaton has 27604 states and 31580 transitions. Word has length 954 [2025-01-09 00:17:57,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:57,184 INFO L471 AbstractCegarLoop]: Abstraction has 27604 states and 31580 transitions. [2025-01-09 00:17:57,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 2 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 27604 states and 31580 transitions. [2025-01-09 00:17:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 957 [2025-01-09 00:17:57,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:57,190 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:17:57,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:17:57,190 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:57,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:57,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1642125699, now seen corresponding path program 1 times [2025-01-09 00:17:57,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:57,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139998366] [2025-01-09 00:17:57,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:57,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:57,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 956 statements into 1 equivalence classes. [2025-01-09 00:17:57,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 956 of 956 statements. [2025-01-09 00:17:57,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:57,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:57,671 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-01-09 00:17:57,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:57,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139998366] [2025-01-09 00:17:57,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139998366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:57,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:57,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:17:57,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398811035] [2025-01-09 00:17:57,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:57,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:17:57,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:57,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:17:57,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:57,673 INFO L87 Difference]: Start difference. First operand 27604 states and 31580 transitions. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:59,233 INFO L93 Difference]: Finished difference Result 58656 states and 67584 transitions. [2025-01-09 00:17:59,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:17:59,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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 956 [2025-01-09 00:17:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:59,272 INFO L225 Difference]: With dead ends: 58656 [2025-01-09 00:17:59,272 INFO L226 Difference]: Without dead ends: 31054 [2025-01-09 00:17:59,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:17:59,294 INFO L435 NwaCegarLoop]: 1097 mSDtfsCounter, 661 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1868 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 2368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:59,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1104 Invalid, 2368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1868 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:17:59,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31054 states. [2025-01-09 00:17:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31054 to 30364. [2025-01-09 00:17:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30364 states, 30363 states have (on average 1.1319698317030595) internal successors, (34370), 30363 states have internal predecessors, (34370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30364 states to 30364 states and 34370 transitions. [2025-01-09 00:17:59,586 INFO L78 Accepts]: Start accepts. Automaton has 30364 states and 34370 transitions. Word has length 956 [2025-01-09 00:17:59,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:59,586 INFO L471 AbstractCegarLoop]: Abstraction has 30364 states and 34370 transitions. [2025-01-09 00:17:59,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:17:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 30364 states and 34370 transitions. [2025-01-09 00:17:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 982 [2025-01-09 00:17:59,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:59,593 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:17:59,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:17:59,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:59,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:59,594 INFO L85 PathProgramCache]: Analyzing trace with hash -29141635, now seen corresponding path program 1 times [2025-01-09 00:17:59,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:59,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535648095] [2025-01-09 00:17:59,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:59,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:59,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 981 statements into 1 equivalence classes. [2025-01-09 00:17:59,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 981 of 981 statements. [2025-01-09 00:17:59,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:59,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 337 proven. 322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:18:00,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:00,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535648095] [2025-01-09 00:18:00,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535648095] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:18:00,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795458585] [2025-01-09 00:18:00,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:00,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:18:00,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:18:00,502 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:18:00,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:18:00,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 981 statements into 1 equivalence classes. [2025-01-09 00:18:00,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 981 of 981 statements. [2025-01-09 00:18:00,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:00,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:00,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:18:00,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:18:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-01-09 00:18:00,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:18:00,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795458585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:00,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:18:00,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 00:18:00,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437383845] [2025-01-09 00:18:00,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:00,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:00,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:00,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:00,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:18:00,751 INFO L87 Difference]: Start difference. First operand 30364 states and 34370 transitions. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:02,114 INFO L93 Difference]: Finished difference Result 60726 states and 68738 transitions. [2025-01-09 00:18:02,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:02,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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 981 [2025-01-09 00:18:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:02,141 INFO L225 Difference]: With dead ends: 60726 [2025-01-09 00:18:02,141 INFO L226 Difference]: Without dead ends: 30364 [2025-01-09 00:18:02,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 987 GetRequests, 981 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:18:02,159 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 755 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:02,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 780 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:18:02,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30364 states. [2025-01-09 00:18:02,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30364 to 30364. [2025-01-09 00:18:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30364 states, 30363 states have (on average 1.1172809010967295) internal successors, (33924), 30363 states have internal predecessors, (33924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30364 states to 30364 states and 33924 transitions. [2025-01-09 00:18:02,372 INFO L78 Accepts]: Start accepts. Automaton has 30364 states and 33924 transitions. Word has length 981 [2025-01-09 00:18:02,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:02,372 INFO L471 AbstractCegarLoop]: Abstraction has 30364 states and 33924 transitions. [2025-01-09 00:18:02,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 30364 states and 33924 transitions. [2025-01-09 00:18:02,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1119 [2025-01-09 00:18:02,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:02,381 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:02,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:18:02,581 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-09 00:18:02,582 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:02,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:02,582 INFO L85 PathProgramCache]: Analyzing trace with hash 179313530, now seen corresponding path program 1 times [2025-01-09 00:18:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:02,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990008410] [2025-01-09 00:18:02,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:02,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1118 statements into 1 equivalence classes. [2025-01-09 00:18:02,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1118 of 1118 statements. [2025-01-09 00:18:02,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:02,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-01-09 00:18:03,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:03,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990008410] [2025-01-09 00:18:03,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990008410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:03,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:03,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:03,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941731084] [2025-01-09 00:18:03,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:03,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:03,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:03,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:03,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:03,147 INFO L87 Difference]: Start difference. First operand 30364 states and 33924 transitions. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:04,726 INFO L93 Difference]: Finished difference Result 69696 states and 77950 transitions. [2025-01-09 00:18:04,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:04,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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 1118 [2025-01-09 00:18:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:04,761 INFO L225 Difference]: With dead ends: 69696 [2025-01-09 00:18:04,761 INFO L226 Difference]: Without dead ends: 35884 [2025-01-09 00:18:04,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:04,782 INFO L435 NwaCegarLoop]: 1090 mSDtfsCounter, 608 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 2152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:04,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1097 Invalid, 2152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:18:04,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35884 states. [2025-01-09 00:18:04,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35884 to 35194. [2025-01-09 00:18:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35194 states, 35193 states have (on average 1.1091694371039695) internal successors, (39035), 35193 states have internal predecessors, (39035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35194 states to 35194 states and 39035 transitions. [2025-01-09 00:18:05,048 INFO L78 Accepts]: Start accepts. Automaton has 35194 states and 39035 transitions. Word has length 1118 [2025-01-09 00:18:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:05,049 INFO L471 AbstractCegarLoop]: Abstraction has 35194 states and 39035 transitions. [2025-01-09 00:18:05,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 35194 states and 39035 transitions. [2025-01-09 00:18:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1139 [2025-01-09 00:18:05,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:05,058 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:05,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:18:05,059 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:05,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:05,059 INFO L85 PathProgramCache]: Analyzing trace with hash 321122748, now seen corresponding path program 1 times [2025-01-09 00:18:05,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:05,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480518413] [2025-01-09 00:18:05,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:05,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:05,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1138 statements into 1 equivalence classes. [2025-01-09 00:18:05,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1138 of 1138 statements. [2025-01-09 00:18:05,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:05,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:05,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 786 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-01-09 00:18:05,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:05,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480518413] [2025-01-09 00:18:05,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480518413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:05,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:05,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:05,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950769556] [2025-01-09 00:18:05,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:05,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:18:05,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:05,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:18:05,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:18:05,850 INFO L87 Difference]: Start difference. First operand 35194 states and 39035 transitions. Second operand has 4 states, 4 states have (on average 199.0) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:08,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:08,870 INFO L93 Difference]: Finished difference Result 70386 states and 78095 transitions. [2025-01-09 00:18:08,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:18:08,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 199.0) internal successors, (796), 3 states have internal predecessors, (796), 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 1138 [2025-01-09 00:18:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:08,920 INFO L225 Difference]: With dead ends: 70386 [2025-01-09 00:18:08,923 INFO L226 Difference]: Without dead ends: 35884 [2025-01-09 00:18:08,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:18:08,943 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 819 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 3097 mSolverCounterSat, 827 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 827 IncrementalHoareTripleChecker+Valid, 3097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:08,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 98 Invalid, 3924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [827 Valid, 3097 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 00:18:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35884 states. [2025-01-09 00:18:09,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35884 to 35194. [2025-01-09 00:18:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35194 states, 35193 states have (on average 1.0919216889722387) internal successors, (38428), 35193 states have internal predecessors, (38428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35194 states to 35194 states and 38428 transitions. [2025-01-09 00:18:09,312 INFO L78 Accepts]: Start accepts. Automaton has 35194 states and 38428 transitions. Word has length 1138 [2025-01-09 00:18:09,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:09,313 INFO L471 AbstractCegarLoop]: Abstraction has 35194 states and 38428 transitions. [2025-01-09 00:18:09,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 199.0) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 35194 states and 38428 transitions. [2025-01-09 00:18:09,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1185 [2025-01-09 00:18:09,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:09,325 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:09,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:18:09,326 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:09,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:09,327 INFO L85 PathProgramCache]: Analyzing trace with hash -255656267, now seen corresponding path program 1 times [2025-01-09 00:18:09,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:09,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675943805] [2025-01-09 00:18:09,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:09,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:09,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1184 statements into 1 equivalence classes. [2025-01-09 00:18:09,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1184 of 1184 statements. [2025-01-09 00:18:09,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:09,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:10,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 563 proven. 758 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-09 00:18:10,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:10,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675943805] [2025-01-09 00:18:10,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675943805] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:18:10,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662989246] [2025-01-09 00:18:10,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:10,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:18:10,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:18:10,726 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:18:10,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:18:10,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1184 statements into 1 equivalence classes. [2025-01-09 00:18:10,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1184 of 1184 statements. [2025-01-09 00:18:10,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:10,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:10,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:18:10,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:18:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-01-09 00:18:11,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:18:11,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662989246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:11,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:18:11,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 00:18:11,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301510647] [2025-01-09 00:18:11,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:11,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:11,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:11,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:11,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:18:11,149 INFO L87 Difference]: Start difference. First operand 35194 states and 38428 transitions. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:12,808 INFO L93 Difference]: Finished difference Result 81426 states and 89581 transitions. [2025-01-09 00:18:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:12,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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 1184 [2025-01-09 00:18:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:12,859 INFO L225 Difference]: With dead ends: 81426 [2025-01-09 00:18:12,859 INFO L226 Difference]: Without dead ends: 46924 [2025-01-09 00:18:12,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1190 GetRequests, 1184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:18:12,896 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 614 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1832 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 1832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:12,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 206 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 1832 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:18:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46924 states. [2025-01-09 00:18:13,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46924 to 46234. [2025-01-09 00:18:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46234 states, 46233 states have (on average 1.082408669132438) internal successors, (50043), 46233 states have internal predecessors, (50043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46234 states to 46234 states and 50043 transitions. [2025-01-09 00:18:13,276 INFO L78 Accepts]: Start accepts. Automaton has 46234 states and 50043 transitions. Word has length 1184 [2025-01-09 00:18:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:13,277 INFO L471 AbstractCegarLoop]: Abstraction has 46234 states and 50043 transitions. [2025-01-09 00:18:13,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 46234 states and 50043 transitions. [2025-01-09 00:18:13,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1222 [2025-01-09 00:18:13,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:13,290 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:13,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 00:18:13,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:18:13,491 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:13,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:13,491 INFO L85 PathProgramCache]: Analyzing trace with hash -977203793, now seen corresponding path program 1 times [2025-01-09 00:18:13,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:13,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935469012] [2025-01-09 00:18:13,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:13,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:13,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-01-09 00:18:13,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-01-09 00:18:13,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:13,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1736 backedges. 906 proven. 0 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2025-01-09 00:18:14,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:14,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935469012] [2025-01-09 00:18:14,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935469012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:14,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:14,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:14,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95251936] [2025-01-09 00:18:14,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:14,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:14,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:14,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:14,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:14,059 INFO L87 Difference]: Start difference. First operand 46234 states and 50043 transitions. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:15,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:15,731 INFO L93 Difference]: Finished difference Result 95916 states and 103589 transitions. [2025-01-09 00:18:15,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:15,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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 1221 [2025-01-09 00:18:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:15,778 INFO L225 Difference]: With dead ends: 95916 [2025-01-09 00:18:15,778 INFO L226 Difference]: Without dead ends: 46234 [2025-01-09 00:18:15,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:15,808 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 652 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:15,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1052 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:18:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46234 states. [2025-01-09 00:18:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46234 to 43474. [2025-01-09 00:18:16,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43474 states, 43473 states have (on average 1.0387596899224807) internal successors, (45158), 43473 states have internal predecessors, (45158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43474 states to 43474 states and 45158 transitions. [2025-01-09 00:18:16,152 INFO L78 Accepts]: Start accepts. Automaton has 43474 states and 45158 transitions. Word has length 1221 [2025-01-09 00:18:16,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:16,153 INFO L471 AbstractCegarLoop]: Abstraction has 43474 states and 45158 transitions. [2025-01-09 00:18:16,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 43474 states and 45158 transitions. [2025-01-09 00:18:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1291 [2025-01-09 00:18:16,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:16,167 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:16,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:18:16,167 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:16,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:16,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1282802480, now seen corresponding path program 1 times [2025-01-09 00:18:16,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:16,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453501296] [2025-01-09 00:18:16,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:16,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:16,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1290 statements into 1 equivalence classes. [2025-01-09 00:18:16,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1290 of 1290 statements. [2025-01-09 00:18:16,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:16,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1934 backedges. 829 proven. 0 refuted. 0 times theorem prover too weak. 1105 trivial. 0 not checked. [2025-01-09 00:18:16,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:16,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453501296] [2025-01-09 00:18:16,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453501296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:16,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:16,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:16,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145947306] [2025-01-09 00:18:16,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:16,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:16,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:16,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:16,632 INFO L87 Difference]: Start difference. First operand 43474 states and 45158 transitions. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:18,272 INFO L93 Difference]: Finished difference Result 105576 states and 109979 transitions. [2025-01-09 00:18:18,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:18,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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 1290 [2025-01-09 00:18:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:18,337 INFO L225 Difference]: With dead ends: 105576 [2025-01-09 00:18:18,338 INFO L226 Difference]: Without dead ends: 62794 [2025-01-09 00:18:18,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:18,366 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 576 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:18,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 93 Invalid, 2063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:18:18,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62794 states. [2025-01-09 00:18:18,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62794 to 61414. [2025-01-09 00:18:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61414 states, 61413 states have (on average 1.0401869311057919) internal successors, (63881), 61413 states have internal predecessors, (63881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61414 states to 61414 states and 63881 transitions. [2025-01-09 00:18:18,846 INFO L78 Accepts]: Start accepts. Automaton has 61414 states and 63881 transitions. Word has length 1290 [2025-01-09 00:18:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:18,847 INFO L471 AbstractCegarLoop]: Abstraction has 61414 states and 63881 transitions. [2025-01-09 00:18:18,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:18,847 INFO L276 IsEmpty]: Start isEmpty. Operand 61414 states and 63881 transitions. [2025-01-09 00:18:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1374 [2025-01-09 00:18:18,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:18,868 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:18,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:18:18,868 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:18,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2038124623, now seen corresponding path program 1 times [2025-01-09 00:18:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:18,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33017581] [2025-01-09 00:18:18,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:18,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1373 statements into 1 equivalence classes. [2025-01-09 00:18:18,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1373 of 1373 statements. [2025-01-09 00:18:18,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:18,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:19,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2797 backedges. 1617 proven. 0 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2025-01-09 00:18:19,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:19,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33017581] [2025-01-09 00:18:19,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33017581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:19,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:19,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:19,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742994392] [2025-01-09 00:18:19,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:19,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:19,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:19,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:19,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:19,430 INFO L87 Difference]: Start difference. First operand 61414 states and 63881 transitions. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:20,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:20,963 INFO L93 Difference]: Finished difference Result 122826 states and 127760 transitions. [2025-01-09 00:18:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:20,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 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 1373 [2025-01-09 00:18:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:21,023 INFO L225 Difference]: With dead ends: 122826 [2025-01-09 00:18:21,023 INFO L226 Difference]: Without dead ends: 62104 [2025-01-09 00:18:21,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:21,061 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 624 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:21,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 947 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:18:21,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62104 states. [2025-01-09 00:18:21,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62104 to 61414. [2025-01-09 00:18:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61414 states, 61413 states have (on average 1.0360021493820526) internal successors, (63624), 61413 states have internal predecessors, (63624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61414 states to 61414 states and 63624 transitions. [2025-01-09 00:18:21,899 INFO L78 Accepts]: Start accepts. Automaton has 61414 states and 63624 transitions. Word has length 1373 [2025-01-09 00:18:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:21,899 INFO L471 AbstractCegarLoop]: Abstraction has 61414 states and 63624 transitions. [2025-01-09 00:18:21,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 61414 states and 63624 transitions. [2025-01-09 00:18:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1385 [2025-01-09 00:18:21,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:21,930 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:21,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:18:21,930 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:21,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:21,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1329952207, now seen corresponding path program 1 times [2025-01-09 00:18:21,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:21,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733752041] [2025-01-09 00:18:21,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:21,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:22,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1384 statements into 1 equivalence classes. [2025-01-09 00:18:22,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1384 of 1384 statements. [2025-01-09 00:18:22,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:22,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2432 backedges. 796 proven. 0 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked. [2025-01-09 00:18:22,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:22,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733752041] [2025-01-09 00:18:22,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733752041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:22,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:22,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:22,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992425461] [2025-01-09 00:18:22,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:22,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:22,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:22,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:22,949 INFO L87 Difference]: Start difference. First operand 61414 states and 63624 transitions. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:24,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:24,438 INFO L93 Difference]: Finished difference Result 131796 states and 136747 transitions. [2025-01-09 00:18:24,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:24,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 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 1384 [2025-01-09 00:18:24,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:24,503 INFO L225 Difference]: With dead ends: 131796 [2025-01-09 00:18:24,504 INFO L226 Difference]: Without dead ends: 70384 [2025-01-09 00:18:24,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:24,539 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 608 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:24,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 265 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:18:24,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70384 states. [2025-01-09 00:18:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70384 to 61414. [2025-01-09 00:18:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61414 states, 61413 states have (on average 1.035904450197841) internal successors, (63618), 61413 states have internal predecessors, (63618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61414 states to 61414 states and 63618 transitions. [2025-01-09 00:18:25,054 INFO L78 Accepts]: Start accepts. Automaton has 61414 states and 63618 transitions. Word has length 1384 [2025-01-09 00:18:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:25,054 INFO L471 AbstractCegarLoop]: Abstraction has 61414 states and 63618 transitions. [2025-01-09 00:18:25,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:25,055 INFO L276 IsEmpty]: Start isEmpty. Operand 61414 states and 63618 transitions. [2025-01-09 00:18:25,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1432 [2025-01-09 00:18:25,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:25,072 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:25,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:18:25,073 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:25,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:25,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1514042198, now seen corresponding path program 1 times [2025-01-09 00:18:25,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:25,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447492041] [2025-01-09 00:18:25,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:25,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:25,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1431 statements into 1 equivalence classes. [2025-01-09 00:18:25,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1431 of 1431 statements. [2025-01-09 00:18:25,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:25,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2187 backedges. 684 proven. 0 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2025-01-09 00:18:26,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:26,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447492041] [2025-01-09 00:18:26,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447492041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:26,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:26,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:26,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110386995] [2025-01-09 00:18:26,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:26,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:26,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:26,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:26,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:26,513 INFO L87 Difference]: Start difference. First operand 61414 states and 63618 transitions. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:28,117 INFO L93 Difference]: Finished difference Result 134556 states and 139870 transitions. [2025-01-09 00:18:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:28,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 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 1431 [2025-01-09 00:18:28,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:28,183 INFO L225 Difference]: With dead ends: 134556 [2025-01-09 00:18:28,183 INFO L226 Difference]: Without dead ends: 72454 [2025-01-09 00:18:28,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:28,219 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 629 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:28,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 796 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:18:28,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72454 states. [2025-01-09 00:18:28,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72454 to 69694. [2025-01-09 00:18:28,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69694 states, 69693 states have (on average 1.0402192472701706) internal successors, (72496), 69693 states have internal predecessors, (72496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69694 states to 69694 states and 72496 transitions. [2025-01-09 00:18:28,888 INFO L78 Accepts]: Start accepts. Automaton has 69694 states and 72496 transitions. Word has length 1431 [2025-01-09 00:18:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:28,889 INFO L471 AbstractCegarLoop]: Abstraction has 69694 states and 72496 transitions. [2025-01-09 00:18:28,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 69694 states and 72496 transitions. [2025-01-09 00:18:28,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1497 [2025-01-09 00:18:28,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:28,925 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:28,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:18:28,926 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:28,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:28,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2077157295, now seen corresponding path program 1 times [2025-01-09 00:18:28,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:28,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506217764] [2025-01-09 00:18:28,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:29,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1496 statements into 1 equivalence classes. [2025-01-09 00:18:29,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1496 of 1496 statements. [2025-01-09 00:18:29,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:29,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2766 backedges. 1271 proven. 1199 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-01-09 00:18:31,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:31,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506217764] [2025-01-09 00:18:31,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506217764] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:18:31,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466358679] [2025-01-09 00:18:31,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:31,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:18:31,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:18:31,013 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:18:31,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:18:31,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1496 statements into 1 equivalence classes. [2025-01-09 00:18:31,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1496 of 1496 statements. [2025-01-09 00:18:31,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:31,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:31,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 1735 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:18:31,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:18:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2766 backedges. 1345 proven. 0 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2025-01-09 00:18:31,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:18:31,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466358679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:31,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:18:31,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 00:18:31,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126281790] [2025-01-09 00:18:31,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:31,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:31,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:31,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:31,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:18:31,505 INFO L87 Difference]: Start difference. First operand 69694 states and 72496 transitions. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:32,916 INFO L93 Difference]: Finished difference Result 138696 states and 144299 transitions. [2025-01-09 00:18:32,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:32,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 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 1496 [2025-01-09 00:18:32,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:32,981 INFO L225 Difference]: With dead ends: 138696 [2025-01-09 00:18:32,981 INFO L226 Difference]: Without dead ends: 69694 [2025-01-09 00:18:33,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1502 GetRequests, 1496 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:18:33,021 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 623 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:33,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 887 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:18:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69694 states. [2025-01-09 00:18:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69694 to 69004. [2025-01-09 00:18:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69004 states, 69003 states have (on average 1.0278683535498456) internal successors, (70926), 69003 states have internal predecessors, (70926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69004 states to 69004 states and 70926 transitions. [2025-01-09 00:18:33,628 INFO L78 Accepts]: Start accepts. Automaton has 69004 states and 70926 transitions. Word has length 1496 [2025-01-09 00:18:33,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:33,629 INFO L471 AbstractCegarLoop]: Abstraction has 69004 states and 70926 transitions. [2025-01-09 00:18:33,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 69004 states and 70926 transitions. [2025-01-09 00:18:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1502 [2025-01-09 00:18:33,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:33,666 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:33,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 00:18:33,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:18:33,867 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:33,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:33,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1685206641, now seen corresponding path program 1 times [2025-01-09 00:18:33,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:33,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036147076] [2025-01-09 00:18:33,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:33,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:33,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1501 statements into 1 equivalence classes. [2025-01-09 00:18:33,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1501 of 1501 statements. [2025-01-09 00:18:33,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:33,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3152 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 2833 trivial. 0 not checked. [2025-01-09 00:18:34,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:34,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036147076] [2025-01-09 00:18:34,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036147076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:34,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:34,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:34,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205247461] [2025-01-09 00:18:34,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:34,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:34,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:34,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:34,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:34,558 INFO L87 Difference]: Start difference. First operand 69004 states and 70926 transitions. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:36,153 INFO L93 Difference]: Finished difference Result 150426 states and 154733 transitions. [2025-01-09 00:18:36,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:36,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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 1501 [2025-01-09 00:18:36,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:36,254 INFO L225 Difference]: With dead ends: 150426 [2025-01-09 00:18:36,254 INFO L226 Difference]: Without dead ends: 80734 [2025-01-09 00:18:36,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:36,301 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 653 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:36,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 952 Invalid, 1964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:18:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80734 states. [2025-01-09 00:18:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80734 to 77974. [2025-01-09 00:18:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77974 states, 77973 states have (on average 1.025701204263014) internal successors, (79977), 77973 states have internal predecessors, (79977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77974 states to 77974 states and 79977 transitions. [2025-01-09 00:18:37,239 INFO L78 Accepts]: Start accepts. Automaton has 77974 states and 79977 transitions. Word has length 1501 [2025-01-09 00:18:37,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:37,240 INFO L471 AbstractCegarLoop]: Abstraction has 77974 states and 79977 transitions. [2025-01-09 00:18:37,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:37,240 INFO L276 IsEmpty]: Start isEmpty. Operand 77974 states and 79977 transitions. [2025-01-09 00:18:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1547 [2025-01-09 00:18:37,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:37,288 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:37,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:18:37,289 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:37,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:37,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1853659282, now seen corresponding path program 1 times [2025-01-09 00:18:37,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:37,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139449638] [2025-01-09 00:18:37,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:37,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:37,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1546 statements into 1 equivalence classes. [2025-01-09 00:18:37,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1546 of 1546 statements. [2025-01-09 00:18:37,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:37,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2702 backedges. 952 proven. 0 refuted. 0 times theorem prover too weak. 1750 trivial. 0 not checked. [2025-01-09 00:18:38,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139449638] [2025-01-09 00:18:38,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139449638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:38,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:38,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:38,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717783201] [2025-01-09 00:18:38,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:38,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:38,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:38,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:38,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:38,214 INFO L87 Difference]: Start difference. First operand 77974 states and 79977 transitions. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:39,656 INFO L93 Difference]: Finished difference Result 155946 states and 159963 transitions. [2025-01-09 00:18:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:39,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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 1546 [2025-01-09 00:18:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:39,744 INFO L225 Difference]: With dead ends: 155946 [2025-01-09 00:18:39,744 INFO L226 Difference]: Without dead ends: 78664 [2025-01-09 00:18:39,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:39,790 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 553 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:39,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 241 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:18:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78664 states. [2025-01-09 00:18:40,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78664 to 77974. [2025-01-09 00:18:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77974 states, 77973 states have (on average 1.0199043258563862) internal successors, (79525), 77973 states have internal predecessors, (79525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77974 states to 77974 states and 79525 transitions. [2025-01-09 00:18:40,544 INFO L78 Accepts]: Start accepts. Automaton has 77974 states and 79525 transitions. Word has length 1546 [2025-01-09 00:18:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:40,545 INFO L471 AbstractCegarLoop]: Abstraction has 77974 states and 79525 transitions. [2025-01-09 00:18:40,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 77974 states and 79525 transitions. [2025-01-09 00:18:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1576 [2025-01-09 00:18:40,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:40,572 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:40,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:18:40,572 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:40,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:40,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2007735506, now seen corresponding path program 1 times [2025-01-09 00:18:40,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:40,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509871708] [2025-01-09 00:18:40,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:40,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:40,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1575 statements into 1 equivalence classes. [2025-01-09 00:18:40,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1575 of 1575 statements. [2025-01-09 00:18:40,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:40,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2521 backedges. 745 proven. 1011 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2025-01-09 00:18:42,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:42,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509871708] [2025-01-09 00:18:42,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509871708] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:18:42,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751720129] [2025-01-09 00:18:42,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:42,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:18:42,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:18:42,376 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:18:42,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 00:18:42,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1575 statements into 1 equivalence classes. [2025-01-09 00:18:42,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1575 of 1575 statements. [2025-01-09 00:18:42,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:42,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:42,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 1795 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:18:42,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:18:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2521 backedges. 901 proven. 0 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2025-01-09 00:18:42,912 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:18:42,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751720129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:42,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:18:42,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:18:42,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541060791] [2025-01-09 00:18:42,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:42,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:42,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:42,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:42,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:18:42,914 INFO L87 Difference]: Start difference. First operand 77974 states and 79525 transitions. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:44,456 INFO L93 Difference]: Finished difference Result 155256 states and 158357 transitions. [2025-01-09 00:18:44,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:44,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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 1575 [2025-01-09 00:18:44,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:44,537 INFO L225 Difference]: With dead ends: 155256 [2025-01-09 00:18:44,537 INFO L226 Difference]: Without dead ends: 77974 [2025-01-09 00:18:44,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1580 GetRequests, 1575 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:18:44,587 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 562 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:44,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 139 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:18:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77974 states. [2025-01-09 00:18:45,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77974 to 77284. [2025-01-09 00:18:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77284 states, 77283 states have (on average 1.016277836005331) internal successors, (78541), 77283 states have internal predecessors, (78541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77284 states to 77284 states and 78541 transitions. [2025-01-09 00:18:45,512 INFO L78 Accepts]: Start accepts. Automaton has 77284 states and 78541 transitions. Word has length 1575 [2025-01-09 00:18:45,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:45,513 INFO L471 AbstractCegarLoop]: Abstraction has 77284 states and 78541 transitions. [2025-01-09 00:18:45,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 77284 states and 78541 transitions. [2025-01-09 00:18:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1746 [2025-01-09 00:18:45,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:45,579 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:18:45,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 00:18:45,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 00:18:45,780 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:45,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:45,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1354974835, now seen corresponding path program 1 times [2025-01-09 00:18:45,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:45,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645972711] [2025-01-09 00:18:45,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:45,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:45,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1745 statements into 1 equivalence classes. [2025-01-09 00:18:45,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1745 of 1745 statements. [2025-01-09 00:18:45,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:45,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2025-01-09 00:18:46,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:46,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645972711] [2025-01-09 00:18:46,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645972711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:46,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:46,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:46,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171454922] [2025-01-09 00:18:46,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:46,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:46,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:46,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:46,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:46,719 INFO L87 Difference]: Start difference. First operand 77284 states and 78541 transitions. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:48,095 INFO L93 Difference]: Finished difference Result 154566 states and 157080 transitions. [2025-01-09 00:18:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:48,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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 1745 [2025-01-09 00:18:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:48,173 INFO L225 Difference]: With dead ends: 154566 [2025-01-09 00:18:48,173 INFO L226 Difference]: Without dead ends: 77284 [2025-01-09 00:18:48,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:48,217 INFO L435 NwaCegarLoop]: 913 mSDtfsCounter, 658 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:48,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 920 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:18:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77284 states. [2025-01-09 00:18:48,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77284 to 75214. [2025-01-09 00:18:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75214 states, 75213 states have (on average 1.0138008057117784) internal successors, (76251), 75213 states have internal predecessors, (76251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75214 states to 75214 states and 76251 transitions. [2025-01-09 00:18:48,966 INFO L78 Accepts]: Start accepts. Automaton has 75214 states and 76251 transitions. Word has length 1745 [2025-01-09 00:18:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:48,966 INFO L471 AbstractCegarLoop]: Abstraction has 75214 states and 76251 transitions. [2025-01-09 00:18:48,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 75214 states and 76251 transitions. [2025-01-09 00:18:49,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1767 [2025-01-09 00:18:49,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:49,003 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09 00:18:49,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 00:18:49,003 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:49,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:49,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1491465579, now seen corresponding path program 1 times [2025-01-09 00:18:49,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:49,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986315008] [2025-01-09 00:18:49,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:49,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:49,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1766 statements into 1 equivalence classes. [2025-01-09 00:18:49,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1766 of 1766 statements. [2025-01-09 00:18:49,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:49,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 2611 trivial. 0 not checked. [2025-01-09 00:18:50,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:50,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986315008] [2025-01-09 00:18:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986315008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:50,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209922190] [2025-01-09 00:18:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:50,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:50,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:50,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:50,140 INFO L87 Difference]: Start difference. First operand 75214 states and 76251 transitions. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:50,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:50,912 INFO L93 Difference]: Finished difference Result 75238 states and 76275 transitions. [2025-01-09 00:18:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:50,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 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 1766 [2025-01-09 00:18:50,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:50,915 INFO L225 Difference]: With dead ends: 75238 [2025-01-09 00:18:50,915 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:18:50,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:50,937 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:50,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 981 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:18:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:18:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:18:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:18:50,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1766 [2025-01-09 00:18:50,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:50,938 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:18:50,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:18:50,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:18:50,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:18:50,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 00:18:50,943 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:50,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:18:53,115 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:18:53,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:18:53 BoogieIcfgContainer [2025-01-09 00:18:53,129 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:18:53,130 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:18:53,130 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:18:53,130 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:18:53,131 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:17:33" (3/4) ... [2025-01-09 00:18:53,132 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:18:53,186 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-09 00:18:53,196 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:18:53,203 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:18:53,211 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:18:53,492 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:18:53,492 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:18:53,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:18:53,492 INFO L158 Benchmark]: Toolchain (without parser) took 84243.20ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 97.3MB in the beginning and 1.1GB in the end (delta: -989.6MB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2025-01-09 00:18:53,493 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:18:53,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 733.08ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 51.2MB in the end (delta: 46.0MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. [2025-01-09 00:18:53,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 184.75ms. Allocated memory is still 142.6MB. Free memory was 51.2MB in the beginning and 65.8MB in the end (delta: -14.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2025-01-09 00:18:53,493 INFO L158 Benchmark]: Boogie Preprocessor took 232.99ms. Allocated memory is still 142.6MB. Free memory was 65.8MB in the beginning and 47.2MB in the end (delta: 18.6MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2025-01-09 00:18:53,493 INFO L158 Benchmark]: RCFGBuilder took 2690.12ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 47.2MB in the beginning and 107.7MB in the end (delta: -60.5MB). Peak memory consumption was 178.5MB. Max. memory is 16.1GB. [2025-01-09 00:18:53,493 INFO L158 Benchmark]: TraceAbstraction took 80035.19ms. Allocated memory was 343.9MB in the beginning and 3.7GB in the end (delta: 3.3GB). Free memory was 105.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2025-01-09 00:18:53,493 INFO L158 Benchmark]: Witness Printer took 362.17ms. Allocated memory is still 3.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 47.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 00:18:53,496 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 733.08ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 51.2MB in the end (delta: 46.0MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 184.75ms. Allocated memory is still 142.6MB. Free memory was 51.2MB in the beginning and 65.8MB in the end (delta: -14.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 232.99ms. Allocated memory is still 142.6MB. Free memory was 65.8MB in the beginning and 47.2MB in the end (delta: 18.6MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2690.12ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 47.2MB in the beginning and 107.7MB in the end (delta: -60.5MB). Peak memory consumption was 178.5MB. Max. memory is 16.1GB. * TraceAbstraction took 80035.19ms. Allocated memory was 343.9MB in the beginning and 3.7GB in the end (delta: 3.3GB). Free memory was 105.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 362.17ms. Allocated memory is still 3.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 47.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 145]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 757 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 77.8s, OverallIterations: 24, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 44.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16376 SdHoareTripleChecker+Valid, 38.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16376 mSDsluCounter, 15320 SdHoareTripleChecker+Invalid, 30.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 9510 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50238 IncrementalHoareTripleChecker+Invalid, 59748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9510 mSolverCounterUnsat, 15132 mSDtfsCounter, 50238 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6248 GetRequests, 6197 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77974occurred in iteration=20, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 30360 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 18.7s InterpolantComputationTime, 32310 NumberOfCodeBlocks, 32310 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 32281 ConstructedInterpolants, 0 QuantifiedInterpolants, 78537 SizeOfPredicates, 0 NumberOfNonLiveVariables, 7087 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 29 InterpolantComputations, 24 PerfectInterpolantSequences, 39895/43191 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4269]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((a24 == 1) && (a18 == 12)) && (a3 <= 417)) || (((a24 == 3) && (a18 <= 8)) && (5 == a15))) || ((a24 == 0) && (a18 == 9))) || (((a24 == 0) && (5 == a15)) && (a18 == 11))) || (((a24 == 3) && (a18 <= 8)) && (a15 <= 4))) || (((6 <= a15) && (a24 == 3)) && (a18 == 11))) || (((((2 <= a24) && (6 <= a15)) && (a18 <= 8)) && (a24 <= 3)) && (a24 != 3))) || (((a3 <= 115) && (a24 == 0)) && (a15 <= 4))) || ((a24 == 1) && (a18 <= 8))) || ((a24 == 1) && (a18 == 11))) || ((((2 <= a24) && (a24 <= 3)) && (a18 == 12)) && (a24 != 3))) || ((((a3 <= 306) && (a24 == 0)) && (a15 == 4)) && (a18 == 10))) || (((5 == a15) && (a18 == 10)) && (a24 == 4))) || (((6 <= a15) && (a24 == 0)) && (a18 == 10))) || (((2 <= a24) && (a18 == 10)) && (a24 <= 3))) || ((((2 <= a24) && (a18 <= 8)) && (a24 <= 3)) && (a3 <= 417))) || ((a24 == 1) && (a18 == 9))) || (((a24 == 3) && (a15 <= 4)) && (a3 <= 99))) || ((a15 <= 4) && (a24 == 4))) || (((a24 == 3) && (a18 == 12)) && (a3 <= 417))) || (((6 <= a15) && (a24 == 0)) && (a18 == 12))) || ((((a18 <= 8) && (5 == a15)) && (a24 == 4)) && (a3 <= 417))) || ((((a15 <= 4) && (a24 <= 3)) && (a18 == 9)) && (a24 != 3))) || ((((5 == a15) && (a18 == 12)) && (a24 == 4)) && (a3 <= 99))) || (((a24 == 3) && (5 == a15)) && (a18 == 11))) || ((((a24 == 3) && (a15 <= 4)) && (a3 <= 417)) && (a18 == 9))) || (((a24 == 1) && (a18 == 10)) && (a3 <= 417))) || ((((2 <= a24) && (a18 == 11)) && (a24 <= 3)) && (a3 <= 417))) || ((((2 <= a24) && (a24 <= 3)) && (a18 == 9)) && (a24 != 3))) || (((6 <= a15) && (a24 == 3)) && (a18 == 9))) || (((((a15 <= 4) && (a18 == 11)) && (a24 <= 3)) && (a24 != 3)) && (a24 != 0))) || (((a24 == 0) && (a18 == 12)) && (a3 <= 417))) || (((a24 == 1) && (5 == a15)) && (a18 == 10))) || ((2 <= a24) && ((((a15 == 4) && (a18 <= 8)) && (a3 <= 99)) || (((a15 <= 4) && (a24 <= 3)) && (a24 != 3))))) || ((a24 == 0) && (a18 <= 8))) || (((a24 == 1) && (5 == a15)) && (a18 == 12))) || (((a24 == 3) && (5 == a15)) && (a18 == 12))) || ((((5 == a15) && (a18 == 11)) && (a24 == 4)) && (a3 <= 417))) || ((a24 == 1) && (a15 <= 4))) || (((a24 == 0) && (5 == a15)) && (a18 == 10))) || (((6 <= a15) && (a24 == 0)) && (a18 == 11))) || (((a24 == 0) && (a18 == 11)) && (a3 <= 417))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:18:53,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE