./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label52.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label52.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 0f8565bc5543801b18fd72f9af86ccf360a9fe950b021c6b04fc8ab7186c8456 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:11:05,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:11:05,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:11:05,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:11:05,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:11:05,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:11:05,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:11:05,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:11:05,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:11:05,312 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:11:05,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:11:05,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:11:05,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:11:05,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:11:05,313 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:11:05,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:11:05,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:11:05,313 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:11:05,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:11:05,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:11:05,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:11:05,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:11:05,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:11:05,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:11:05,313 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:11:05,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:11:05,313 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:11:05,313 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:11:05,313 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:11:05,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:11:05,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:11:05,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:11:05,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:11:05,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:11:05,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:11:05,314 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:11:05,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:11:05,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:11:05,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:11:05,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:11:05,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:11:05,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:11:05,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:11:05,314 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/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 -> 0f8565bc5543801b18fd72f9af86ccf360a9fe950b021c6b04fc8ab7186c8456 [2025-03-16 15:11:05,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:11:05,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:11:05,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:11:05,664 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:11:05,665 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:11:05,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label52.c [2025-03-16 15:11:06,823 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a34502c/06fdacaab7a943d0b77b1245aa1c5839/FLAGb6a5c02b3 [2025-03-16 15:11:07,220 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:11:07,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label52.c [2025-03-16 15:11:07,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a34502c/06fdacaab7a943d0b77b1245aa1c5839/FLAGb6a5c02b3 [2025-03-16 15:11:07,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a34502c/06fdacaab7a943d0b77b1245aa1c5839 [2025-03-16 15:11:07,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:11:07,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:11:07,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:11:07,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:11:07,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:11:07,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:11:07" (1/1) ... [2025-03-16 15:11:07,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab1b04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:07, skipping insertion in model container [2025-03-16 15:11:07,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:11:07" (1/1) ... [2025-03-16 15:11:07,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:11:07,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label52.c[4872,4885] [2025-03-16 15:11:07,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:11:07,832 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:11:07,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label52.c[4872,4885] [2025-03-16 15:11:07,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:11:07,979 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:11:07,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:07 WrapperNode [2025-03-16 15:11:07,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:11:07,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:11:07,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:11:07,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:11:07,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:07" (1/1) ... [2025-03-16 15:11:08,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:07" (1/1) ... [2025-03-16 15:11:08,159 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-16 15:11:08,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:11:08,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:11:08,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:11:08,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:11:08,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:07" (1/1) ... [2025-03-16 15:11:08,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:07" (1/1) ... [2025-03-16 15:11:08,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:07" (1/1) ... [2025-03-16 15:11:08,277 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-03-16 15:11:08,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:07" (1/1) ... [2025-03-16 15:11:08,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:07" (1/1) ... [2025-03-16 15:11:08,322 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:07" (1/1) ... [2025-03-16 15:11:08,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:07" (1/1) ... [2025-03-16 15:11:08,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:07" (1/1) ... [2025-03-16 15:11:08,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:07" (1/1) ... [2025-03-16 15:11:08,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:11:08,376 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:11:08,377 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:11:08,377 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:11:08,377 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:07" (1/1) ... [2025-03-16 15:11:08,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:11:08,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:08,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:11:08,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:11:08,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:11:08,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:11:08,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:11:08,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:11:08,474 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:11:08,476 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:11:10,251 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-16 15:11:10,352 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-16 15:11:10,352 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:11:10,370 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:11:10,374 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:11:10,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:11:10 BoogieIcfgContainer [2025-03-16 15:11:10,374 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:11:10,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:11:10,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:11:10,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:11:10,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:11:07" (1/3) ... [2025-03-16 15:11:10,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f30b14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:11:10, skipping insertion in model container [2025-03-16 15:11:10,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:11:07" (2/3) ... [2025-03-16 15:11:10,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f30b14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:11:10, skipping insertion in model container [2025-03-16 15:11:10,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:11:10" (3/3) ... [2025-03-16 15:11:10,382 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label52.c [2025-03-16 15:11:10,393 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:11:10,394 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label52.c that has 1 procedures, 363 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:11:10,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:11:10,456 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;@4b4fa18a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:11:10,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:11:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 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-03-16 15:11:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 15:11:10,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:10,468 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] [2025-03-16 15:11:10,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:10,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:10,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1772729580, now seen corresponding path program 1 times [2025-03-16 15:11:10,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:10,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989709807] [2025-03-16 15:11:10,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:10,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 15:11:10,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 15:11:10,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:10,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:10,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:10,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989709807] [2025-03-16 15:11:10,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989709807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:10,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:10,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:10,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361689114] [2025-03-16 15:11:10,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:10,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:11:10,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:10,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:11:10,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:11:10,609 INFO L87 Difference]: Start difference. First operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 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 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-03-16 15:11:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:10,649 INFO L93 Difference]: Finished difference Result 725 states and 1375 transitions. [2025-03-16 15:11:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:11:10,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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 38 [2025-03-16 15:11:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:10,659 INFO L225 Difference]: With dead ends: 725 [2025-03-16 15:11:10,659 INFO L226 Difference]: Without dead ends: 360 [2025-03-16 15:11:10,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:11:10,665 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:10,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:11:10,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-16 15:11:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-16 15:11:10,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 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-03-16 15:11:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2025-03-16 15:11:10,708 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 38 [2025-03-16 15:11:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:10,708 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2025-03-16 15:11:10,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-03-16 15:11:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2025-03-16 15:11:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 15:11:10,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:10,709 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] [2025-03-16 15:11:10,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:11:10,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:10,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash 939115609, now seen corresponding path program 1 times [2025-03-16 15:11:10,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:10,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651699137] [2025-03-16 15:11:10,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:10,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:10,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 15:11:10,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 15:11:10,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:10,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:10,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:10,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651699137] [2025-03-16 15:11:10,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651699137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:10,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:10,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:10,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913674965] [2025-03-16 15:11:10,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:10,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:10,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:10,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:10,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:10,854 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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-03-16 15:11:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:12,095 INFO L93 Difference]: Finished difference Result 1023 states and 1787 transitions. [2025-03-16 15:11:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:12,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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 38 [2025-03-16 15:11:12,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:12,098 INFO L225 Difference]: With dead ends: 1023 [2025-03-16 15:11:12,098 INFO L226 Difference]: Without dead ends: 664 [2025-03-16 15:11:12,099 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-03-16 15:11:12,100 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 278 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:12,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 319 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:11:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-16 15:11:12,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 662. [2025-03-16 15:11:12,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.4826021180030258) internal successors, (980), 661 states have internal predecessors, (980), 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-03-16 15:11:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 980 transitions. [2025-03-16 15:11:12,125 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 980 transitions. Word has length 38 [2025-03-16 15:11:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:12,125 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 980 transitions. [2025-03-16 15:11:12,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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-03-16 15:11:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 980 transitions. [2025-03-16 15:11:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 15:11:12,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:12,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 15:11:12,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:11:12,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:12,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1654979383, now seen corresponding path program 1 times [2025-03-16 15:11:12,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:12,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728058427] [2025-03-16 15:11:12,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:12,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:12,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 15:11:12,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 15:11:12,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:12,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:12,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:12,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728058427] [2025-03-16 15:11:12,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728058427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:12,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:12,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:12,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146145730] [2025-03-16 15:11:12,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:12,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:12,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:12,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:12,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:12,487 INFO L87 Difference]: Start difference. First operand 662 states and 980 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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-03-16 15:11:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:13,676 INFO L93 Difference]: Finished difference Result 1623 states and 2314 transitions. [2025-03-16 15:11:13,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:13,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 103 [2025-03-16 15:11:13,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:13,680 INFO L225 Difference]: With dead ends: 1623 [2025-03-16 15:11:13,680 INFO L226 Difference]: Without dead ends: 962 [2025-03-16 15:11:13,681 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-03-16 15:11:13,681 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:13,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 336 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:11:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-03-16 15:11:13,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2025-03-16 15:11:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3631633714880333) internal successors, (1310), 961 states have internal predecessors, (1310), 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-03-16 15:11:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1310 transitions. [2025-03-16 15:11:13,699 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1310 transitions. Word has length 103 [2025-03-16 15:11:13,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:13,700 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1310 transitions. [2025-03-16 15:11:13,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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-03-16 15:11:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1310 transitions. [2025-03-16 15:11:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 15:11:13,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:13,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 15:11:13,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:11:13,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:13,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:13,703 INFO L85 PathProgramCache]: Analyzing trace with hash -158945248, now seen corresponding path program 1 times [2025-03-16 15:11:13,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:13,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915082243] [2025-03-16 15:11:13,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:13,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:13,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 15:11:13,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 15:11:13,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:13,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:13,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:13,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915082243] [2025-03-16 15:11:13,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915082243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:13,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:13,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:11:13,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436332235] [2025-03-16 15:11:13,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:13,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:11:13,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:13,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:11:13,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:11:13,957 INFO L87 Difference]: Start difference. First operand 962 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 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-03-16 15:11:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:15,421 INFO L93 Difference]: Finished difference Result 2239 states and 3196 transitions. [2025-03-16 15:11:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:11:15,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 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 108 [2025-03-16 15:11:15,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:15,426 INFO L225 Difference]: With dead ends: 2239 [2025-03-16 15:11:15,426 INFO L226 Difference]: Without dead ends: 1577 [2025-03-16 15:11:15,427 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-03-16 15:11:15,428 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 357 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:15,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 367 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:11:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2025-03-16 15:11:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1265. [2025-03-16 15:11:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.3045886075949367) internal successors, (1649), 1264 states have internal predecessors, (1649), 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-03-16 15:11:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1649 transitions. [2025-03-16 15:11:15,447 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1649 transitions. Word has length 108 [2025-03-16 15:11:15,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:15,447 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1649 transitions. [2025-03-16 15:11:15,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 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-03-16 15:11:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1649 transitions. [2025-03-16 15:11:15,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-16 15:11:15,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:15,449 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:15,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:11:15,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:15,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:15,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1979048524, now seen corresponding path program 1 times [2025-03-16 15:11:15,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:15,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978054541] [2025-03-16 15:11:15,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:15,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:15,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-16 15:11:15,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-16 15:11:15,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:15,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:15,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978054541] [2025-03-16 15:11:15,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978054541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:15,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:15,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:15,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94800731] [2025-03-16 15:11:15,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:15,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:11:15,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:15,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:11:15,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:11:15,646 INFO L87 Difference]: Start difference. First operand 1265 states and 1649 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 3 states have internal predecessors, (204), 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-03-16 15:11:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:17,847 INFO L93 Difference]: Finished difference Result 4669 states and 6169 transitions. [2025-03-16 15:11:17,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:11:17,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 3 states have internal predecessors, (204), 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 204 [2025-03-16 15:11:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:17,871 INFO L225 Difference]: With dead ends: 4669 [2025-03-16 15:11:17,871 INFO L226 Difference]: Without dead ends: 3405 [2025-03-16 15:11:17,872 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-03-16 15:11:17,873 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 489 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:17,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 345 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:11:17,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2025-03-16 15:11:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3380. [2025-03-16 15:11:17,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 1.2367564368156259) internal successors, (4179), 3379 states have internal predecessors, (4179), 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-03-16 15:11:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 4179 transitions. [2025-03-16 15:11:17,909 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 4179 transitions. Word has length 204 [2025-03-16 15:11:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:17,909 INFO L471 AbstractCegarLoop]: Abstraction has 3380 states and 4179 transitions. [2025-03-16 15:11:17,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 3 states have internal predecessors, (204), 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-03-16 15:11:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 4179 transitions. [2025-03-16 15:11:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 15:11:17,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:17,911 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:17,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:11:17,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:17,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:17,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1494003562, now seen corresponding path program 1 times [2025-03-16 15:11:17,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:17,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246444575] [2025-03-16 15:11:17,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:17,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:17,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 15:11:17,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 15:11:17,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:17,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 15:11:18,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:18,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246444575] [2025-03-16 15:11:18,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246444575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:18,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:18,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:18,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647644842] [2025-03-16 15:11:18,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:18,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:18,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:18,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:18,059 INFO L87 Difference]: Start difference. First operand 3380 states and 4179 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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-03-16 15:11:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:19,092 INFO L93 Difference]: Finished difference Result 8562 states and 10753 transitions. [2025-03-16 15:11:19,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:19,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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 208 [2025-03-16 15:11:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:19,104 INFO L225 Difference]: With dead ends: 8562 [2025-03-16 15:11:19,105 INFO L226 Difference]: Without dead ends: 5482 [2025-03-16 15:11:19,107 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-03-16 15:11:19,107 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:19,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:11:19,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2025-03-16 15:11:19,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 5477. [2025-03-16 15:11:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.168736303871439) internal successors, (6400), 5476 states have internal predecessors, (6400), 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-03-16 15:11:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6400 transitions. [2025-03-16 15:11:19,177 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6400 transitions. Word has length 208 [2025-03-16 15:11:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:19,177 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6400 transitions. [2025-03-16 15:11:19,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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-03-16 15:11:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6400 transitions. [2025-03-16 15:11:19,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-16 15:11:19,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:19,181 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:19,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:11:19,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:19,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:19,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1502995782, now seen corresponding path program 1 times [2025-03-16 15:11:19,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:19,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631303405] [2025-03-16 15:11:19,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:19,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:19,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-16 15:11:19,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-16 15:11:19,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:19,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-16 15:11:19,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:19,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631303405] [2025-03-16 15:11:19,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631303405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:19,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:19,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:11:19,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009120814] [2025-03-16 15:11:19,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:19,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:19,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:19,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:19,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:19,604 INFO L87 Difference]: Start difference. First operand 5477 states and 6400 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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-03-16 15:11:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:20,510 INFO L93 Difference]: Finished difference Result 10654 states and 12488 transitions. [2025-03-16 15:11:20,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:20,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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 310 [2025-03-16 15:11:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:20,521 INFO L225 Difference]: With dead ends: 10654 [2025-03-16 15:11:20,521 INFO L226 Difference]: Without dead ends: 5477 [2025-03-16 15:11:20,524 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-03-16 15:11:20,525 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:20,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 358 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:11:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2025-03-16 15:11:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 5477. [2025-03-16 15:11:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.1676406135865596) internal successors, (6394), 5476 states have internal predecessors, (6394), 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-03-16 15:11:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6394 transitions. [2025-03-16 15:11:20,608 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6394 transitions. Word has length 310 [2025-03-16 15:11:20,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:20,609 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6394 transitions. [2025-03-16 15:11:20,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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-03-16 15:11:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6394 transitions. [2025-03-16 15:11:20,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-16 15:11:20,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:20,613 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:20,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:11:20,613 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:20,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:20,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1570006603, now seen corresponding path program 1 times [2025-03-16 15:11:20,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:20,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802177568] [2025-03-16 15:11:20,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:20,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:20,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-16 15:11:20,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-16 15:11:20,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:20,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-16 15:11:20,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:20,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802177568] [2025-03-16 15:11:20,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802177568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:20,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:20,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:20,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386234858] [2025-03-16 15:11:20,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:20,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:20,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:20,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:20,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:20,809 INFO L87 Difference]: Start difference. First operand 5477 states and 6394 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-03-16 15:11:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:21,871 INFO L93 Difference]: Finished difference Result 11850 states and 14150 transitions. [2025-03-16 15:11:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:21,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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 325 [2025-03-16 15:11:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:21,883 INFO L225 Difference]: With dead ends: 11850 [2025-03-16 15:11:21,883 INFO L226 Difference]: Without dead ends: 6673 [2025-03-16 15:11:21,886 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-03-16 15:11:21,886 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 275 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:21,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 323 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:11:21,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2025-03-16 15:11:21,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 4875. [2025-03-16 15:11:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.1805498563807961) internal successors, (5754), 4874 states have internal predecessors, (5754), 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-03-16 15:11:21,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 5754 transitions. [2025-03-16 15:11:21,935 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 5754 transitions. Word has length 325 [2025-03-16 15:11:21,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:21,936 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 5754 transitions. [2025-03-16 15:11:21,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-03-16 15:11:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 5754 transitions. [2025-03-16 15:11:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-03-16 15:11:21,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:21,942 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:21,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:11:21,942 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:21,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:21,943 INFO L85 PathProgramCache]: Analyzing trace with hash -763809370, now seen corresponding path program 1 times [2025-03-16 15:11:21,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:21,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186350461] [2025-03-16 15:11:21,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:21,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:21,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-03-16 15:11:21,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-03-16 15:11:21,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:21,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 15:11:22,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:22,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186350461] [2025-03-16 15:11:22,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186350461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:22,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:22,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340186373] [2025-03-16 15:11:22,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:22,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:22,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:22,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:22,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:22,205 INFO L87 Difference]: Start difference. First operand 4875 states and 5754 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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-03-16 15:11:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:23,481 INFO L93 Difference]: Finished difference Result 12742 states and 15152 transitions. [2025-03-16 15:11:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:23,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 384 [2025-03-16 15:11:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:23,498 INFO L225 Difference]: With dead ends: 12742 [2025-03-16 15:11:23,498 INFO L226 Difference]: Without dead ends: 6373 [2025-03-16 15:11:23,503 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-03-16 15:11:23,503 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 305 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:23,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 610 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:11:23,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2025-03-16 15:11:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 6074. [2025-03-16 15:11:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6074 states, 6073 states have (on average 1.1159229375926232) internal successors, (6777), 6073 states have internal predecessors, (6777), 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-03-16 15:11:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 6777 transitions. [2025-03-16 15:11:23,557 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 6777 transitions. Word has length 384 [2025-03-16 15:11:23,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:23,558 INFO L471 AbstractCegarLoop]: Abstraction has 6074 states and 6777 transitions. [2025-03-16 15:11:23,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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-03-16 15:11:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 6777 transitions. [2025-03-16 15:11:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-16 15:11:23,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:23,562 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:23,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:11:23,562 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:23,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:23,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1995812053, now seen corresponding path program 1 times [2025-03-16 15:11:23,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:23,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090330742] [2025-03-16 15:11:23,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:23,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:23,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-16 15:11:23,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-16 15:11:23,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:23,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:11:23,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:23,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090330742] [2025-03-16 15:11:23,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090330742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:23,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:23,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:23,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570411729] [2025-03-16 15:11:23,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:23,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:23,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:23,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:23,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:23,791 INFO L87 Difference]: Start difference. First operand 6074 states and 6777 transitions. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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-03-16 15:11:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:24,769 INFO L93 Difference]: Finished difference Result 14251 states and 16128 transitions. [2025-03-16 15:11:24,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:24,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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 401 [2025-03-16 15:11:24,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:24,783 INFO L225 Difference]: With dead ends: 14251 [2025-03-16 15:11:24,783 INFO L226 Difference]: Without dead ends: 8477 [2025-03-16 15:11:24,788 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-03-16 15:11:24,788 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 237 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:24,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 604 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:11:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8477 states. [2025-03-16 15:11:24,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8477 to 7577. [2025-03-16 15:11:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7577 states, 7576 states have (on average 1.103220696937698) internal successors, (8358), 7576 states have internal predecessors, (8358), 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-03-16 15:11:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 8358 transitions. [2025-03-16 15:11:24,841 INFO L78 Accepts]: Start accepts. Automaton has 7577 states and 8358 transitions. Word has length 401 [2025-03-16 15:11:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:24,841 INFO L471 AbstractCegarLoop]: Abstraction has 7577 states and 8358 transitions. [2025-03-16 15:11:24,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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-03-16 15:11:24,842 INFO L276 IsEmpty]: Start isEmpty. Operand 7577 states and 8358 transitions. [2025-03-16 15:11:24,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-03-16 15:11:24,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:24,863 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:24,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:11:24,863 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:24,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash -614654860, now seen corresponding path program 1 times [2025-03-16 15:11:24,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:24,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310742209] [2025-03-16 15:11:24,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:24,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:24,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-16 15:11:24,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-16 15:11:24,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:24,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 15:11:25,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:25,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310742209] [2025-03-16 15:11:25,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310742209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:25,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:25,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:25,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276936743] [2025-03-16 15:11:25,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:25,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:25,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:25,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:25,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:25,107 INFO L87 Difference]: Start difference. First operand 7577 states and 8358 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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-03-16 15:11:26,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:26,148 INFO L93 Difference]: Finished difference Result 17547 states and 19600 transitions. [2025-03-16 15:11:26,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:26,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 415 [2025-03-16 15:11:26,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:26,164 INFO L225 Difference]: With dead ends: 17547 [2025-03-16 15:11:26,165 INFO L226 Difference]: Without dead ends: 10270 [2025-03-16 15:11:26,171 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-03-16 15:11:26,172 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 286 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:26,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 566 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:11:26,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10270 states. [2025-03-16 15:11:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10270 to 9967. [2025-03-16 15:11:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9967 states, 9966 states have (on average 1.0910094320690347) internal successors, (10873), 9966 states have internal predecessors, (10873), 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-03-16 15:11:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9967 states to 9967 states and 10873 transitions. [2025-03-16 15:11:26,270 INFO L78 Accepts]: Start accepts. Automaton has 9967 states and 10873 transitions. Word has length 415 [2025-03-16 15:11:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:26,271 INFO L471 AbstractCegarLoop]: Abstraction has 9967 states and 10873 transitions. [2025-03-16 15:11:26,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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-03-16 15:11:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand 9967 states and 10873 transitions. [2025-03-16 15:11:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-03-16 15:11:26,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:26,275 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 15:11:26,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:11:26,275 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:26,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash -266841929, now seen corresponding path program 1 times [2025-03-16 15:11:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:26,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078863945] [2025-03-16 15:11:26,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:26,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-03-16 15:11:26,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-03-16 15:11:26,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:26,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 15:11:26,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:26,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078863945] [2025-03-16 15:11:26,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078863945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:26,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:26,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:26,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088757575] [2025-03-16 15:11:26,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:26,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:26,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:26,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:26,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:26,561 INFO L87 Difference]: Start difference. First operand 9967 states and 10873 transitions. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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-03-16 15:11:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:27,617 INFO L93 Difference]: Finished difference Result 22627 states and 24853 transitions. [2025-03-16 15:11:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:27,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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 512 [2025-03-16 15:11:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:27,638 INFO L225 Difference]: With dead ends: 22627 [2025-03-16 15:11:27,638 INFO L226 Difference]: Without dead ends: 11764 [2025-03-16 15:11:27,648 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-03-16 15:11:27,648 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 244 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:27,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 554 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:11:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11764 states. [2025-03-16 15:11:27,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11764 to 11764. [2025-03-16 15:11:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11764 states, 11763 states have (on average 1.0777012666836692) internal successors, (12677), 11763 states have internal predecessors, (12677), 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-03-16 15:11:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11764 states to 11764 states and 12677 transitions. [2025-03-16 15:11:27,741 INFO L78 Accepts]: Start accepts. Automaton has 11764 states and 12677 transitions. Word has length 512 [2025-03-16 15:11:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:27,741 INFO L471 AbstractCegarLoop]: Abstraction has 11764 states and 12677 transitions. [2025-03-16 15:11:27,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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-03-16 15:11:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 11764 states and 12677 transitions. [2025-03-16 15:11:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-16 15:11:27,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:27,745 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 15:11:27,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:11:27,745 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:27,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:27,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1929380121, now seen corresponding path program 1 times [2025-03-16 15:11:27,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:27,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941037051] [2025-03-16 15:11:27,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:27,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:27,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-16 15:11:27,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-16 15:11:27,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:27,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 15:11:28,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:28,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941037051] [2025-03-16 15:11:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941037051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:28,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846498391] [2025-03-16 15:11:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:28,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:28,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:28,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:28,043 INFO L87 Difference]: Start difference. First operand 11764 states and 12677 transitions. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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-03-16 15:11:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:28,923 INFO L93 Difference]: Finished difference Result 27414 states and 29733 transitions. [2025-03-16 15:11:28,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:28,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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 539 [2025-03-16 15:11:28,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:28,971 INFO L225 Difference]: With dead ends: 27414 [2025-03-16 15:11:28,971 INFO L226 Difference]: Without dead ends: 15950 [2025-03-16 15:11:28,979 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-03-16 15:11:28,979 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 258 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:28,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 134 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:11:28,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15950 states. [2025-03-16 15:11:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15950 to 14156. [2025-03-16 15:11:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14156 states, 14155 states have (on average 1.085694101024373) internal successors, (15368), 14155 states have internal predecessors, (15368), 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-03-16 15:11:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14156 states to 14156 states and 15368 transitions. [2025-03-16 15:11:29,157 INFO L78 Accepts]: Start accepts. Automaton has 14156 states and 15368 transitions. Word has length 539 [2025-03-16 15:11:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:29,158 INFO L471 AbstractCegarLoop]: Abstraction has 14156 states and 15368 transitions. [2025-03-16 15:11:29,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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-03-16 15:11:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 14156 states and 15368 transitions. [2025-03-16 15:11:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2025-03-16 15:11:29,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:29,167 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:29,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:11:29,167 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:29,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:29,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1770480227, now seen corresponding path program 1 times [2025-03-16 15:11:29,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:29,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154809637] [2025-03-16 15:11:29,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:29,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:29,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 684 statements into 1 equivalence classes. [2025-03-16 15:11:29,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 684 of 684 statements. [2025-03-16 15:11:29,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:29,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 445 proven. 119 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2025-03-16 15:11:30,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:30,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154809637] [2025-03-16 15:11:30,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154809637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:30,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580591034] [2025-03-16 15:11:30,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:30,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:30,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:30,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:11:30,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:11:30,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 684 statements into 1 equivalence classes. [2025-03-16 15:11:30,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 684 of 684 statements. [2025-03-16 15:11:30,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:30,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:30,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:11:30,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:11:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 445 proven. 150 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-03-16 15:11:30,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:11:31,036 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2025-03-16 15:11:31,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580591034] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:31,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:11:31,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 9 [2025-03-16 15:11:31,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011063662] [2025-03-16 15:11:31,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:31,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:31,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:31,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:31,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:11:31,038 INFO L87 Difference]: Start difference. First operand 14156 states and 15368 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-03-16 15:11:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:31,952 INFO L93 Difference]: Finished difference Result 34301 states and 37461 transitions. [2025-03-16 15:11:31,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:31,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 684 [2025-03-16 15:11:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:31,977 INFO L225 Difference]: With dead ends: 34301 [2025-03-16 15:11:31,977 INFO L226 Difference]: Without dead ends: 20445 [2025-03-16 15:11:31,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1371 GetRequests, 1364 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:11:31,988 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 308 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:31,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 436 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:11:32,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20445 states. [2025-03-16 15:11:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20445 to 18640. [2025-03-16 15:11:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18640 states, 18639 states have (on average 1.0935136005150492) internal successors, (20382), 18639 states have internal predecessors, (20382), 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-03-16 15:11:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18640 states to 18640 states and 20382 transitions. [2025-03-16 15:11:32,139 INFO L78 Accepts]: Start accepts. Automaton has 18640 states and 20382 transitions. Word has length 684 [2025-03-16 15:11:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:32,139 INFO L471 AbstractCegarLoop]: Abstraction has 18640 states and 20382 transitions. [2025-03-16 15:11:32,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-03-16 15:11:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 18640 states and 20382 transitions. [2025-03-16 15:11:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2025-03-16 15:11:32,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:32,146 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:32,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:11:32,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 15:11:32,346 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:32,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:32,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1413496010, now seen corresponding path program 1 times [2025-03-16 15:11:32,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:32,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219492536] [2025-03-16 15:11:32,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:32,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:32,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-03-16 15:11:32,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-03-16 15:11:32,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:32,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 547 proven. 74 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-03-16 15:11:33,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:33,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219492536] [2025-03-16 15:11:33,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219492536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:33,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333023694] [2025-03-16 15:11:33,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:33,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:33,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:33,308 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:11:33,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:11:33,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-03-16 15:11:33,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-03-16 15:11:33,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:33,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:33,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:11:33,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:11:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 545 proven. 76 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-03-16 15:11:33,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:11:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-16 15:11:34,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333023694] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:34,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:11:34,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 8 [2025-03-16 15:11:34,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899134166] [2025-03-16 15:11:34,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:34,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:34,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:34,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:34,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:11:34,518 INFO L87 Difference]: Start difference. First operand 18640 states and 20382 transitions. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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-03-16 15:11:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:35,416 INFO L93 Difference]: Finished difference Result 40274 states and 44357 transitions. [2025-03-16 15:11:35,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:35,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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 697 [2025-03-16 15:11:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:35,435 INFO L225 Difference]: With dead ends: 40274 [2025-03-16 15:11:35,435 INFO L226 Difference]: Without dead ends: 21934 [2025-03-16 15:11:35,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1398 GetRequests, 1392 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:11:35,447 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 228 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:35,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 83 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:11:35,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21934 states. [2025-03-16 15:11:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21934 to 21630. [2025-03-16 15:11:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21630 states, 21629 states have (on average 1.1025937398862637) internal successors, (23848), 21629 states have internal predecessors, (23848), 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-03-16 15:11:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21630 states to 21630 states and 23848 transitions. [2025-03-16 15:11:35,687 INFO L78 Accepts]: Start accepts. Automaton has 21630 states and 23848 transitions. Word has length 697 [2025-03-16 15:11:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:35,687 INFO L471 AbstractCegarLoop]: Abstraction has 21630 states and 23848 transitions. [2025-03-16 15:11:35,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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-03-16 15:11:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 21630 states and 23848 transitions. [2025-03-16 15:11:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-03-16 15:11:35,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:35,694 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:35,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 15:11:35,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 15:11:35,895 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:35,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:35,896 INFO L85 PathProgramCache]: Analyzing trace with hash -881224802, now seen corresponding path program 1 times [2025-03-16 15:11:35,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:35,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311754111] [2025-03-16 15:11:35,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:35,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:35,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-16 15:11:35,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-16 15:11:35,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:35,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2025-03-16 15:11:36,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:36,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311754111] [2025-03-16 15:11:36,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311754111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:36,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:36,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:36,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635900480] [2025-03-16 15:11:36,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:36,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:36,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:36,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:36,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:36,339 INFO L87 Difference]: Start difference. First operand 21630 states and 23848 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-03-16 15:11:37,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:37,214 INFO L93 Difference]: Finished difference Result 45960 states and 50525 transitions. [2025-03-16 15:11:37,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:37,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 709 [2025-03-16 15:11:37,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:37,240 INFO L225 Difference]: With dead ends: 45960 [2025-03-16 15:11:37,240 INFO L226 Difference]: Without dead ends: 24630 [2025-03-16 15:11:37,256 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-03-16 15:11:37,256 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 270 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:37,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 583 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:11:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24630 states. [2025-03-16 15:11:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24630 to 22529. [2025-03-16 15:11:37,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22529 states, 22528 states have (on average 1.0996537642045454) internal successors, (24773), 22528 states have internal predecessors, (24773), 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-03-16 15:11:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22529 states to 22529 states and 24773 transitions. [2025-03-16 15:11:37,493 INFO L78 Accepts]: Start accepts. Automaton has 22529 states and 24773 transitions. Word has length 709 [2025-03-16 15:11:37,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:37,493 INFO L471 AbstractCegarLoop]: Abstraction has 22529 states and 24773 transitions. [2025-03-16 15:11:37,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-03-16 15:11:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 22529 states and 24773 transitions. [2025-03-16 15:11:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2025-03-16 15:11:37,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:37,500 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:37,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:11:37,500 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:37,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash 927753757, now seen corresponding path program 1 times [2025-03-16 15:11:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:37,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843947258] [2025-03-16 15:11:37,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:37,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:37,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 723 statements into 1 equivalence classes. [2025-03-16 15:11:37,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 723 of 723 statements. [2025-03-16 15:11:37,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:37,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-16 15:11:38,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:38,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843947258] [2025-03-16 15:11:38,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843947258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:38,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:38,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:38,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627390577] [2025-03-16 15:11:38,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:38,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:38,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:38,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:38,130 INFO L87 Difference]: Start difference. First operand 22529 states and 24773 transitions. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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-03-16 15:11:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:38,857 INFO L93 Difference]: Finished difference Result 44762 states and 49249 transitions. [2025-03-16 15:11:38,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:38,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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 723 [2025-03-16 15:11:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:38,878 INFO L225 Difference]: With dead ends: 44762 [2025-03-16 15:11:38,878 INFO L226 Difference]: Without dead ends: 22533 [2025-03-16 15:11:38,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-03-16 15:11:38,893 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 231 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:38,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 126 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:11:38,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22533 states. [2025-03-16 15:11:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22533 to 21931. [2025-03-16 15:11:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21931 states, 21930 states have (on average 1.0885088919288646) internal successors, (23871), 21930 states have internal predecessors, (23871), 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-03-16 15:11:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21931 states to 21931 states and 23871 transitions. [2025-03-16 15:11:39,049 INFO L78 Accepts]: Start accepts. Automaton has 21931 states and 23871 transitions. Word has length 723 [2025-03-16 15:11:39,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:39,050 INFO L471 AbstractCegarLoop]: Abstraction has 21931 states and 23871 transitions. [2025-03-16 15:11:39,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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-03-16 15:11:39,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21931 states and 23871 transitions. [2025-03-16 15:11:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-16 15:11:39,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:39,056 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:39,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:11:39,056 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:39,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash 882213079, now seen corresponding path program 1 times [2025-03-16 15:11:39,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:39,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654038309] [2025-03-16 15:11:39,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:39,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:39,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-16 15:11:39,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-16 15:11:39,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:39,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 531 proven. 188 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-16 15:11:39,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:39,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654038309] [2025-03-16 15:11:39,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654038309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:39,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325267187] [2025-03-16 15:11:39,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:39,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:39,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:39,825 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:11:39,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:11:39,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-16 15:11:39,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-16 15:11:39,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:39,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:39,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:11:39,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:11:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 526 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-16 15:11:40,160 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:11:40,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325267187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:40,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:11:40,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-16 15:11:40,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891765753] [2025-03-16 15:11:40,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:40,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:11:40,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:40,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:11:40,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:11:40,161 INFO L87 Difference]: Start difference. First operand 21931 states and 23871 transitions. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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-03-16 15:11:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:41,612 INFO L93 Difference]: Finished difference Result 52856 states and 57478 transitions. [2025-03-16 15:11:41,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:11:41,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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 729 [2025-03-16 15:11:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:41,641 INFO L225 Difference]: With dead ends: 52856 [2025-03-16 15:11:41,642 INFO L226 Difference]: Without dead ends: 31225 [2025-03-16 15:11:41,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:11:41,656 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 533 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:41,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 137 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1730 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:11:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31225 states. [2025-03-16 15:11:41,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31225 to 29724. [2025-03-16 15:11:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29724 states, 29723 states have (on average 1.0854557077011069) internal successors, (32263), 29723 states have internal predecessors, (32263), 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-03-16 15:11:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29724 states to 29724 states and 32263 transitions. [2025-03-16 15:11:41,904 INFO L78 Accepts]: Start accepts. Automaton has 29724 states and 32263 transitions. Word has length 729 [2025-03-16 15:11:41,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:41,904 INFO L471 AbstractCegarLoop]: Abstraction has 29724 states and 32263 transitions. [2025-03-16 15:11:41,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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-03-16 15:11:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 29724 states and 32263 transitions. [2025-03-16 15:11:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2025-03-16 15:11:41,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:41,962 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 15:11:41,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 15:11:42,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 15:11:42,162 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:42,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:42,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1793416108, now seen corresponding path program 1 times [2025-03-16 15:11:42,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:42,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941489316] [2025-03-16 15:11:42,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:42,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:42,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 786 statements into 1 equivalence classes. [2025-03-16 15:11:42,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 786 of 786 statements. [2025-03-16 15:11:42,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:42,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2025-03-16 15:11:42,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:42,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941489316] [2025-03-16 15:11:42,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941489316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:42,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:42,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:42,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484555328] [2025-03-16 15:11:42,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:42,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:42,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:42,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:42,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:42,715 INFO L87 Difference]: Start difference. First operand 29724 states and 32263 transitions. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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-03-16 15:11:43,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:43,640 INFO L93 Difference]: Finished difference Result 60640 states and 65867 transitions. [2025-03-16 15:11:43,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:43,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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 786 [2025-03-16 15:11:43,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:43,668 INFO L225 Difference]: With dead ends: 60640 [2025-03-16 15:11:43,668 INFO L226 Difference]: Without dead ends: 30020 [2025-03-16 15:11:43,687 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-03-16 15:11:43,688 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 226 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:43,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 503 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:11:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30020 states. [2025-03-16 15:11:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30020 to 27019. [2025-03-16 15:11:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27019 states, 27018 states have (on average 1.075690280553705) internal successors, (29063), 27018 states have internal predecessors, (29063), 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-03-16 15:11:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27019 states to 27019 states and 29063 transitions. [2025-03-16 15:11:43,998 INFO L78 Accepts]: Start accepts. Automaton has 27019 states and 29063 transitions. Word has length 786 [2025-03-16 15:11:43,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:43,999 INFO L471 AbstractCegarLoop]: Abstraction has 27019 states and 29063 transitions. [2025-03-16 15:11:43,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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-03-16 15:11:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 27019 states and 29063 transitions. [2025-03-16 15:11:44,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2025-03-16 15:11:44,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:44,009 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 15:11:44,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:11:44,010 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:44,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:44,010 INFO L85 PathProgramCache]: Analyzing trace with hash -555318012, now seen corresponding path program 1 times [2025-03-16 15:11:44,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:44,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662804927] [2025-03-16 15:11:44,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:44,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:44,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 861 statements into 1 equivalence classes. [2025-03-16 15:11:44,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 861 of 861 statements. [2025-03-16 15:11:44,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:44,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 961 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-16 15:11:44,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:44,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662804927] [2025-03-16 15:11:44,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662804927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:44,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:44,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727275775] [2025-03-16 15:11:44,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:44,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:44,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:44,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:44,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:44,377 INFO L87 Difference]: Start difference. First operand 27019 states and 29063 transitions. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-03-16 15:11:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:45,165 INFO L93 Difference]: Finished difference Result 53732 states and 57923 transitions. [2025-03-16 15:11:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:45,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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 861 [2025-03-16 15:11:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:45,195 INFO L225 Difference]: With dead ends: 53732 [2025-03-16 15:11:45,195 INFO L226 Difference]: Without dead ends: 27013 [2025-03-16 15:11:45,211 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-03-16 15:11:45,212 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 103 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:45,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 555 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:11:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27013 states. [2025-03-16 15:11:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27013 to 26116. [2025-03-16 15:11:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26116 states, 26115 states have (on average 1.061458931648478) internal successors, (27720), 26115 states have internal predecessors, (27720), 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-03-16 15:11:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26116 states to 26116 states and 27720 transitions. [2025-03-16 15:11:45,412 INFO L78 Accepts]: Start accepts. Automaton has 26116 states and 27720 transitions. Word has length 861 [2025-03-16 15:11:45,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:45,412 INFO L471 AbstractCegarLoop]: Abstraction has 26116 states and 27720 transitions. [2025-03-16 15:11:45,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-03-16 15:11:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 26116 states and 27720 transitions. [2025-03-16 15:11:45,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2025-03-16 15:11:45,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:45,425 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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-03-16 15:11:45,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:11:45,425 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:45,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:45,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2009067740, now seen corresponding path program 1 times [2025-03-16 15:11:45,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:45,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046262232] [2025-03-16 15:11:45,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:45,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:45,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 909 statements into 1 equivalence classes. [2025-03-16 15:11:45,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 909 of 909 statements. [2025-03-16 15:11:45,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:45,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 239 proven. 1185 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-16 15:11:47,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:47,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046262232] [2025-03-16 15:11:47,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046262232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:47,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891237797] [2025-03-16 15:11:47,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:47,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:47,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:47,275 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:11:47,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:11:47,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 909 statements into 1 equivalence classes. [2025-03-16 15:11:47,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 909 of 909 statements. [2025-03-16 15:11:47,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:47,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:47,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:11:47,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:11:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 953 proven. 0 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-03-16 15:11:47,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:11:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891237797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:47,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:11:47,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-16 15:11:47,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168188956] [2025-03-16 15:11:47,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:47,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:11:47,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:47,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:11:47,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:11:47,817 INFO L87 Difference]: Start difference. First operand 26116 states and 27720 transitions. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 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-03-16 15:11:49,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:49,073 INFO L93 Difference]: Finished difference Result 31218 states and 32978 transitions. [2025-03-16 15:11:49,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:11:49,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 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 909 [2025-03-16 15:11:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:49,095 INFO L225 Difference]: With dead ends: 31218 [2025-03-16 15:11:49,095 INFO L226 Difference]: Without dead ends: 31216 [2025-03-16 15:11:49,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 907 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:11:49,100 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 522 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:49,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 133 Invalid, 1926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:11:49,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31216 states. [2025-03-16 15:11:49,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31216 to 24018. [2025-03-16 15:11:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24018 states, 24017 states have (on average 1.064121247449723) internal successors, (25557), 24017 states have internal predecessors, (25557), 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-03-16 15:11:49,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24018 states to 24018 states and 25557 transitions. [2025-03-16 15:11:49,273 INFO L78 Accepts]: Start accepts. Automaton has 24018 states and 25557 transitions. Word has length 909 [2025-03-16 15:11:49,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:49,273 INFO L471 AbstractCegarLoop]: Abstraction has 24018 states and 25557 transitions. [2025-03-16 15:11:49,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 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-03-16 15:11:49,273 INFO L276 IsEmpty]: Start isEmpty. Operand 24018 states and 25557 transitions. [2025-03-16 15:11:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2025-03-16 15:11:49,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:49,285 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:49,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:11:49,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:49,485 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:49,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:49,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1426472563, now seen corresponding path program 1 times [2025-03-16 15:11:49,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:49,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639675905] [2025-03-16 15:11:49,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:49,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:49,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 927 statements into 1 equivalence classes. [2025-03-16 15:11:49,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 927 of 927 statements. [2025-03-16 15:11:49,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:49,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 729 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2025-03-16 15:11:49,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:49,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639675905] [2025-03-16 15:11:49,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639675905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:49,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:49,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:49,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81989986] [2025-03-16 15:11:49,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:49,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:49,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:49,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:49,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:49,938 INFO L87 Difference]: Start difference. First operand 24018 states and 25557 transitions. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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-03-16 15:11:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:50,756 INFO L93 Difference]: Finished difference Result 47134 states and 50171 transitions. [2025-03-16 15:11:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:50,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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 927 [2025-03-16 15:11:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:50,781 INFO L225 Difference]: With dead ends: 47134 [2025-03-16 15:11:50,781 INFO L226 Difference]: Without dead ends: 23416 [2025-03-16 15:11:50,796 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-03-16 15:11:50,797 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 208 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:50,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 530 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:11:50,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23416 states. [2025-03-16 15:11:50,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23416 to 22818. [2025-03-16 15:11:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22818 states, 22817 states have (on average 1.045536222991629) internal successors, (23856), 22817 states have internal predecessors, (23856), 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-03-16 15:11:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22818 states to 22818 states and 23856 transitions. [2025-03-16 15:11:51,010 INFO L78 Accepts]: Start accepts. Automaton has 22818 states and 23856 transitions. Word has length 927 [2025-03-16 15:11:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:51,011 INFO L471 AbstractCegarLoop]: Abstraction has 22818 states and 23856 transitions. [2025-03-16 15:11:51,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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-03-16 15:11:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 22818 states and 23856 transitions. [2025-03-16 15:11:51,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 948 [2025-03-16 15:11:51,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:51,021 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:11:51,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:11:51,022 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:51,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:51,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1685938187, now seen corresponding path program 1 times [2025-03-16 15:11:51,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:51,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806266735] [2025-03-16 15:11:51,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:51,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:51,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 947 statements into 1 equivalence classes. [2025-03-16 15:11:51,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 947 of 947 statements. [2025-03-16 15:11:51,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:51,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 596 proven. 0 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2025-03-16 15:11:51,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:51,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806266735] [2025-03-16 15:11:51,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806266735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:51,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:51,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:51,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295288003] [2025-03-16 15:11:51,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:51,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:51,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:51,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:51,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:51,519 INFO L87 Difference]: Start difference. First operand 22818 states and 23856 transitions. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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-03-16 15:11:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:52,315 INFO L93 Difference]: Finished difference Result 50432 states and 52684 transitions. [2025-03-16 15:11:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:52,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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 947 [2025-03-16 15:11:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:52,353 INFO L225 Difference]: With dead ends: 50432 [2025-03-16 15:11:52,354 INFO L226 Difference]: Without dead ends: 27914 [2025-03-16 15:11:52,370 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-03-16 15:11:52,371 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 174 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:52,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 555 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:11:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27914 states. [2025-03-16 15:11:52,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27914 to 25809. [2025-03-16 15:11:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25809 states, 25808 states have (on average 1.0428936763794172) internal successors, (26915), 25808 states have internal predecessors, (26915), 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-03-16 15:11:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25809 states to 25809 states and 26915 transitions. [2025-03-16 15:11:52,688 INFO L78 Accepts]: Start accepts. Automaton has 25809 states and 26915 transitions. Word has length 947 [2025-03-16 15:11:52,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:52,688 INFO L471 AbstractCegarLoop]: Abstraction has 25809 states and 26915 transitions. [2025-03-16 15:11:52,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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-03-16 15:11:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 25809 states and 26915 transitions. [2025-03-16 15:11:52,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2025-03-16 15:11:52,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:52,703 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:11:52,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 15:11:52,703 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:52,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:52,704 INFO L85 PathProgramCache]: Analyzing trace with hash -485133150, now seen corresponding path program 1 times [2025-03-16 15:11:52,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:52,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236480998] [2025-03-16 15:11:52,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:52,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:52,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1031 statements into 1 equivalence classes. [2025-03-16 15:11:52,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1031 of 1031 statements. [2025-03-16 15:11:52,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:52,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 1237 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2025-03-16 15:11:53,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:53,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236480998] [2025-03-16 15:11:53,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236480998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:11:53,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:11:53,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:11:53,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171989902] [2025-03-16 15:11:53,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:11:53,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:11:53,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:11:53,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:11:53,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:11:53,275 INFO L87 Difference]: Start difference. First operand 25809 states and 26915 transitions. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 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-03-16 15:11:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:11:54,203 INFO L93 Difference]: Finished difference Result 56720 states and 59070 transitions. [2025-03-16 15:11:54,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:11:54,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 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 1031 [2025-03-16 15:11:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:11:54,233 INFO L225 Difference]: With dead ends: 56720 [2025-03-16 15:11:54,233 INFO L226 Difference]: Without dead ends: 31211 [2025-03-16 15:11:54,251 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-03-16 15:11:54,251 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 132 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:11:54,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 147 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:11:54,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31211 states. [2025-03-16 15:11:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31211 to 27005. [2025-03-16 15:11:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27005 states, 27004 states have (on average 1.0406606428677232) internal successors, (28102), 27004 states have internal predecessors, (28102), 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-03-16 15:11:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27005 states to 27005 states and 28102 transitions. [2025-03-16 15:11:54,575 INFO L78 Accepts]: Start accepts. Automaton has 27005 states and 28102 transitions. Word has length 1031 [2025-03-16 15:11:54,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:11:54,576 INFO L471 AbstractCegarLoop]: Abstraction has 27005 states and 28102 transitions. [2025-03-16 15:11:54,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 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-03-16 15:11:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 27005 states and 28102 transitions. [2025-03-16 15:11:54,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1080 [2025-03-16 15:11:54,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:11:54,600 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, 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, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:11:54,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 15:11:54,600 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:11:54,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:11:54,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2113022273, now seen corresponding path program 1 times [2025-03-16 15:11:54,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:11:54,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285246035] [2025-03-16 15:11:54,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:54,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:11:54,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1079 statements into 1 equivalence classes. [2025-03-16 15:11:54,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1079 of 1079 statements. [2025-03-16 15:11:54,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:54,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2334 backedges. 0 proven. 2086 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-16 15:11:57,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:11:57,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285246035] [2025-03-16 15:11:57,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285246035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:11:57,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168398939] [2025-03-16 15:11:57,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:11:57,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:11:57,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:11:57,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:11:57,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:11:57,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1079 statements into 1 equivalence classes. [2025-03-16 15:11:57,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1079 of 1079 statements. [2025-03-16 15:11:57,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:11:57,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:11:57,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:11:57,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:12:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2334 backedges. 1470 proven. 0 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2025-03-16 15:12:00,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:12:00,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168398939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:00,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:12:00,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 15:12:00,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244067677] [2025-03-16 15:12:00,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:00,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:12:00,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:00,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:12:00,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:12:00,430 INFO L87 Difference]: Start difference. First operand 27005 states and 28102 transitions. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 3 states have internal predecessors, (648), 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-03-16 15:12:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:02,082 INFO L93 Difference]: Finished difference Result 62998 states and 65494 transitions. [2025-03-16 15:12:02,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:12:02,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 3 states have internal predecessors, (648), 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 1079 [2025-03-16 15:12:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:02,117 INFO L225 Difference]: With dead ends: 62998 [2025-03-16 15:12:02,117 INFO L226 Difference]: Without dead ends: 35994 [2025-03-16 15:12:02,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1085 GetRequests, 1077 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:12:02,135 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 296 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:02,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 121 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:12:02,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35994 states. [2025-03-16 15:12:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35994 to 33288. [2025-03-16 15:12:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33288 states, 33287 states have (on average 1.0392645777630907) internal successors, (34594), 33287 states have internal predecessors, (34594), 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-03-16 15:12:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33288 states to 33288 states and 34594 transitions. [2025-03-16 15:12:02,516 INFO L78 Accepts]: Start accepts. Automaton has 33288 states and 34594 transitions. Word has length 1079 [2025-03-16 15:12:02,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:02,516 INFO L471 AbstractCegarLoop]: Abstraction has 33288 states and 34594 transitions. [2025-03-16 15:12:02,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 3 states have internal predecessors, (648), 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-03-16 15:12:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 33288 states and 34594 transitions. [2025-03-16 15:12:02,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1117 [2025-03-16 15:12:02,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:02,533 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, 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, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:12:02,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 15:12:02,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-16 15:12:02,734 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:02,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:02,734 INFO L85 PathProgramCache]: Analyzing trace with hash 127734245, now seen corresponding path program 1 times [2025-03-16 15:12:02,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:02,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10815093] [2025-03-16 15:12:02,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:02,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:02,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1116 statements into 1 equivalence classes. [2025-03-16 15:12:02,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1116 of 1116 statements. [2025-03-16 15:12:02,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:02,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2334 backedges. 74 proven. 1081 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2025-03-16 15:12:03,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:03,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10815093] [2025-03-16 15:12:03,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10815093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:03,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226719287] [2025-03-16 15:12:03,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:03,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:03,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:03,862 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:12:03,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 15:12:03,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1116 statements into 1 equivalence classes. [2025-03-16 15:12:04,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1116 of 1116 statements. [2025-03-16 15:12:04,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:04,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:04,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:12:04,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:12:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2334 backedges. 74 proven. 1081 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2025-03-16 15:12:06,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:12:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2334 backedges. 74 proven. 1081 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2025-03-16 15:12:09,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226719287] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:12:09,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:12:09,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-16 15:12:09,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702327990] [2025-03-16 15:12:09,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:12:09,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 15:12:09,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:09,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 15:12:09,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:12:09,166 INFO L87 Difference]: Start difference. First operand 33288 states and 34594 transitions. Second operand has 10 states, 10 states have (on average 111.4) internal successors, (1114), 9 states have internal predecessors, (1114), 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-03-16 15:12:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:12,324 INFO L93 Difference]: Finished difference Result 88740 states and 91980 transitions. [2025-03-16 15:12:12,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 15:12:12,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 111.4) internal successors, (1114), 9 states have internal predecessors, (1114), 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 1116 [2025-03-16 15:12:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:12,382 INFO L225 Difference]: With dead ends: 88740 [2025-03-16 15:12:12,383 INFO L226 Difference]: Without dead ends: 55752 [2025-03-16 15:12:12,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2241 GetRequests, 2226 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-03-16 15:12:12,410 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 2666 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3478 mSolverCounterSat, 957 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2666 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 4435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 957 IncrementalHoareTripleChecker+Valid, 3478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:12,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2666 Valid, 192 Invalid, 4435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [957 Valid, 3478 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 15:12:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55752 states. [2025-03-16 15:12:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55752 to 31788. [2025-03-16 15:12:12,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31788 states, 31787 states have (on average 1.0406770063233397) internal successors, (33080), 31787 states have internal predecessors, (33080), 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-03-16 15:12:12,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31788 states to 31788 states and 33080 transitions. [2025-03-16 15:12:12,862 INFO L78 Accepts]: Start accepts. Automaton has 31788 states and 33080 transitions. Word has length 1116 [2025-03-16 15:12:12,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:12,862 INFO L471 AbstractCegarLoop]: Abstraction has 31788 states and 33080 transitions. [2025-03-16 15:12:12,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.4) internal successors, (1114), 9 states have internal predecessors, (1114), 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-03-16 15:12:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 31788 states and 33080 transitions. [2025-03-16 15:12:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1397 [2025-03-16 15:12:12,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:12,882 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 15:12:12,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 15:12:13,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-16 15:12:13,083 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:13,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash 815015372, now seen corresponding path program 1 times [2025-03-16 15:12:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:13,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108192052] [2025-03-16 15:12:13,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:13,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:13,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1396 statements into 1 equivalence classes. [2025-03-16 15:12:13,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1396 of 1396 statements. [2025-03-16 15:12:13,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:13,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3463 backedges. 1986 proven. 0 refuted. 0 times theorem prover too weak. 1477 trivial. 0 not checked. [2025-03-16 15:12:13,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:13,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108192052] [2025-03-16 15:12:13,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108192052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:13,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:13,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302860863] [2025-03-16 15:12:13,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:13,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:13,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:13,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:13,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:13,556 INFO L87 Difference]: Start difference. First operand 31788 states and 33080 transitions. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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-03-16 15:12:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:14,281 INFO L93 Difference]: Finished difference Result 63275 states and 65855 transitions. [2025-03-16 15:12:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:14,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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 1396 [2025-03-16 15:12:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:14,310 INFO L225 Difference]: With dead ends: 63275 [2025-03-16 15:12:14,310 INFO L226 Difference]: Without dead ends: 31787 [2025-03-16 15:12:14,328 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-03-16 15:12:14,328 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 312 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:14,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 554 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:12:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31787 states. [2025-03-16 15:12:14,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31787 to 31189. [2025-03-16 15:12:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31189 states, 31188 states have (on average 1.040816980890086) internal successors, (32461), 31188 states have internal predecessors, (32461), 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-03-16 15:12:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31189 states to 31189 states and 32461 transitions. [2025-03-16 15:12:14,610 INFO L78 Accepts]: Start accepts. Automaton has 31189 states and 32461 transitions. Word has length 1396 [2025-03-16 15:12:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:14,610 INFO L471 AbstractCegarLoop]: Abstraction has 31189 states and 32461 transitions. [2025-03-16 15:12:14,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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-03-16 15:12:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 31189 states and 32461 transitions. [2025-03-16 15:12:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1404 [2025-03-16 15:12:14,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:14,630 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 15:12:14,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 15:12:14,630 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:14,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash 691446869, now seen corresponding path program 1 times [2025-03-16 15:12:14,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:14,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247077609] [2025-03-16 15:12:14,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:14,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:14,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1403 statements into 1 equivalence classes. [2025-03-16 15:12:14,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1403 of 1403 statements. [2025-03-16 15:12:14,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:14,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4446 backedges. 2986 proven. 0 refuted. 0 times theorem prover too weak. 1460 trivial. 0 not checked. [2025-03-16 15:12:15,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:15,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247077609] [2025-03-16 15:12:15,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247077609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:15,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:15,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:15,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277970940] [2025-03-16 15:12:15,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:15,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:15,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:15,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:15,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:15,067 INFO L87 Difference]: Start difference. First operand 31189 states and 32461 transitions. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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-03-16 15:12:15,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:15,629 INFO L93 Difference]: Finished difference Result 45874 states and 47458 transitions. [2025-03-16 15:12:15,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:15,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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 1403 [2025-03-16 15:12:15,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:15,631 INFO L225 Difference]: With dead ends: 45874 [2025-03-16 15:12:15,631 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:12:15,645 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-03-16 15:12:15,646 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 152 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:15,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 371 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:12:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:12:15,646 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-03-16 15:12:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:12:15,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1403 [2025-03-16 15:12:15,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:15,647 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:12:15,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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-03-16 15:12:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:12:15,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:12:15,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:12:15,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 15:12:15,652 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, 1, 1, 1, 1] [2025-03-16 15:12:15,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:12:22,554 WARN L286 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 535 DAG size of output: 667 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-16 15:12:25,583 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:12:25,606 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-16 15:12:25,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:12:25 BoogieIcfgContainer [2025-03-16 15:12:25,613 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:12:25,613 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:12:25,613 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:12:25,613 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:12:25,614 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:11:10" (3/4) ... [2025-03-16 15:12:25,617 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:12:25,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-16 15:12:25,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:12:25,645 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:12:25,646 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:12:25,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:12:25,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:12:25,777 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:12:25,778 INFO L158 Benchmark]: Toolchain (without parser) took 78374.37ms. Allocated memory was 167.8MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 118.5MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 842.8MB. Max. memory is 16.1GB. [2025-03-16 15:12:25,778 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:12:25,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.67ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 45.6MB in the end (delta: 72.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-16 15:12:25,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 179.15ms. Allocated memory is still 167.8MB. Free memory was 45.6MB in the beginning and 85.8MB in the end (delta: -40.2MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2025-03-16 15:12:25,779 INFO L158 Benchmark]: Boogie Preprocessor took 214.81ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 96.8MB in the end (delta: -11.0MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2025-03-16 15:12:25,780 INFO L158 Benchmark]: IcfgBuilder took 1998.19ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 96.8MB in the beginning and 293.1MB in the end (delta: -196.3MB). Peak memory consumption was 206.3MB. Max. memory is 16.1GB. [2025-03-16 15:12:25,780 INFO L158 Benchmark]: TraceAbstraction took 75237.09ms. Allocated memory was 377.5MB in the beginning and 2.6GB in the end (delta: 2.2GB). Free memory was 293.1MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2025-03-16 15:12:25,781 INFO L158 Benchmark]: Witness Printer took 164.21ms. Allocated memory is still 2.6GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 15:12:25,781 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.21ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.67ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 45.6MB in the end (delta: 72.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 179.15ms. Allocated memory is still 167.8MB. Free memory was 45.6MB in the beginning and 85.8MB in the end (delta: -40.2MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 214.81ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 96.8MB in the end (delta: -11.0MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. * IcfgBuilder took 1998.19ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 96.8MB in the beginning and 293.1MB in the end (delta: -196.3MB). Peak memory consumption was 206.3MB. Max. memory is 16.1GB. * TraceAbstraction took 75237.09ms. Allocated memory was 377.5MB in the beginning and 2.6GB in the end (delta: 2.2GB). Free memory was 293.1MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 164.21ms. Allocated memory is still 2.6GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 134]: 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, 363 locations, 688 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.2s, OverallIterations: 28, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 31.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9689 SdHoareTripleChecker+Valid, 28.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9689 mSDsluCounter, 10507 SdHoareTripleChecker+Invalid, 24.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1154 mSDsCounter, 5651 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29757 IncrementalHoareTripleChecker+Invalid, 35408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5651 mSolverCounterUnsat, 9353 mSDtfsCounter, 29757 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7806 GetRequests, 7734 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33288occurred in iteration=25, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 57024 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 24.0s InterpolantComputationTime, 22796 NumberOfCodeBlocks, 22796 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 25256 ConstructedInterpolants, 430 QuantifiedInterpolants, 103604 SizeOfPredicates, 2 NumberOfNonLiveVariables, 6134 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 37 InterpolantComputations, 27 PerfectInterpolantSequences, 32900/40021 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: 1776]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((((((0 <= (((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1)) + 61)) && (5 == a2)) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && ((0 < (((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1)) + 61)) || (((((long long) 2 + a0) >= 0) ? (((long long) 2 + a0) % 5) : ((((long long) 2 + a0) % 5) + 5)) != 0))) || (((((0 <= (((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1)) + 61)) && (5 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && ((0 < (((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1)) + 61)) || (((((long long) 2 + a0) >= 0) ? (((long long) 2 + a0) % 5) : ((((long long) 2 + a0) % 5) + 5)) != 0)))) || ((((5 == a2) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 99) <= 0)) && (0 <= ((long long) 146 + a0)))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600371))) || ((((0 <= ((long long) a0 + 599997)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (a2 == 1))) || ((((0 <= ((long long) a4 + 85)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (3 == a2))) || (((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && ((a2 != 4) || (0 < ((long long) a29 + 16))))) || (((((0 <= ((long long) 600000 + a0)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (a2 == 1))) || ((((0 <= ((long long) a0 + 599997)) && (((long long) a0 + 147) <= 0)) && (3 == a2)) && (a29 < 44))) || ((((((0 <= (((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1)) + 61)) && (a29 <= 41)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && ((0 < (((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1)) + 61)) || (((((long long) 2 + a0) >= 0) ? (((long long) 2 + a0) % 5) : ((((long long) 2 + a0) % 5) + 5)) != 0))) && (3 == a2))) || (((((5 == a2) && (44 <= a29)) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a0 + 60))) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600371))) || (((0 <= ((long long) a4 + 85)) && (((long long) a0 + 147) <= 0)) && (a2 == 4))) || ((((((a29 <= 41) && (0 <= ((long long) a0 + 599997))) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (a2 == 1)) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600371))) || (((((5 == a2) && (a29 <= 41)) && (0 <= ((long long) a29 + 15))) && (((long long) 89 + a4) <= 0)) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600371))) || ((((0 <= ((long long) a4 + 85)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || ((((((long long) 89 + a4) <= 0) && (((long long) 52093 + a29) <= 0)) && (a2 == 4)) && (((long long) 44 + a0) <= 0))) || (((((2 == a2) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0)))) || ((((long long) a0 + 99) <= 0) && (((long long) 89 + a4) <= 0))) || (((((5 == a2) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0)))) || ((((((0 <= (((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1)) + 61)) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0)) && ((0 < (((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1)) + 61)) || (((((long long) 2 + a0) >= 0) ? (((long long) 2 + a0) % 5) : ((((long long) 2 + a0) % 5) + 5)) != 0)))) || (((((long long) 89 + a4) <= 0) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600371)) && (3 == a2))) || ((((((a29 <= 41) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0)))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600371))) || ((((((0 <= (((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1)) + 61)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0)) && (a2 == 4)) && ((0 < (((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1)) + 61)) || (((((long long) 2 + a0) >= 0) ? (((long long) 2 + a0) % 5) : ((((long long) 2 + a0) % 5) + 5)) != 0)))) || ((((((0 <= (((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1)) + 61)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && ((0 < (((((long long) 600067 + a0) >= 0) ? (((long long) 600067 + a0) / 5) : ((((long long) 600067 + a0) / 5) - 1)) + 61)) || (((((long long) 2 + a0) >= 0) ? (((long long) 2 + a0) % 5) : ((((long long) 2 + a0) % 5) + 5)) != 0))) && (3 == a2))) || (((((a29 <= 41) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) 146 + a0))) && (a2 == 1)) && (((long long) 44 + a0) <= 0))) || ((((0 <= ((long long) a0 + 599997)) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0))) || ((((((long long) 89 + a4) <= 0) && (0 <= ((long long) a0 + 60))) && (a2 == 4)) && ((((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) >= 0) ? ((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) : (((3459790 + ((long long) ((a0 >= 0) ? (a0 / 5) : ((a0 / 5) - 1)) * 10)) / 9) - 1)) <= 600371))) || ((((((0 <= ((long long) 600000 + a0)) && (a29 <= 41)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (a2 == 1)) && (((long long) 44 + a0) <= 0))) || (((((0 <= ((long long) a4 + 85)) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 4))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:12:25,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE