./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/Problem11_label05.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 6998e746c84ec80cbdf636f88f142c2942fd045c8cffd9bc8881e887e07cd119 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:31:23,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:31:23,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:31:23,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:31:23,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:31:23,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:31:23,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:31:23,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:31:23,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:31:23,777 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:31:23,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:31:23,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:31:23,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:31:23,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:31:23,778 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:31:23,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:31:23,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:31:23,779 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:31:23,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:31:23,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:31:23,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:31:23,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:31:23,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:31:23,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:31:23,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:31:23,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:31:23,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:31:23,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:31:23,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:31:23,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:31:23,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:31:23,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:31:23,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:31:23,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:31:23,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:31:23,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:31:23,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:31:23,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:31:23,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:31:23,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:31:23,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:31:23,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:31:23,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:31:23,782 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 -> 6998e746c84ec80cbdf636f88f142c2942fd045c8cffd9bc8881e887e07cd119 [2025-03-03 10:31:24,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:31:24,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:31:24,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:31:24,022 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:31:24,022 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:31:24,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label05.c [2025-03-03 10:31:25,175 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0774f7319/f2a6aa98246944ea864c4996b9a79c5a/FLAG87c49f497 [2025-03-03 10:31:25,453 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:31:25,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label05.c [2025-03-03 10:31:25,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0774f7319/f2a6aa98246944ea864c4996b9a79c5a/FLAG87c49f497 [2025-03-03 10:31:25,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0774f7319/f2a6aa98246944ea864c4996b9a79c5a [2025-03-03 10:31:25,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:31:25,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:31:25,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:31:25,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:31:25,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:31:25,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:31:25" (1/1) ... [2025-03-03 10:31:25,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2334be49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:25, skipping insertion in model container [2025-03-03 10:31:25,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:31:25" (1/1) ... [2025-03-03 10:31:25,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:31:25,662 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/Problem11_label05.c[9225,9238] [2025-03-03 10:31:25,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:31:25,774 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:31:25,791 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/Problem11_label05.c[9225,9238] [2025-03-03 10:31:25,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:31:25,875 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:31:25,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:25 WrapperNode [2025-03-03 10:31:25,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:31:25,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:31:25,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:31:25,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:31:25,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:25" (1/1) ... [2025-03-03 10:31:25,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:25" (1/1) ... [2025-03-03 10:31:25,985 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-03 10:31:25,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:31:25,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:31:25,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:31:25,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:31:25,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:25" (1/1) ... [2025-03-03 10:31:25,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:25" (1/1) ... [2025-03-03 10:31:26,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:25" (1/1) ... [2025-03-03 10:31:26,068 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-03 10:31:26,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:25" (1/1) ... [2025-03-03 10:31:26,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:25" (1/1) ... [2025-03-03 10:31:26,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:25" (1/1) ... [2025-03-03 10:31:26,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:25" (1/1) ... [2025-03-03 10:31:26,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:25" (1/1) ... [2025-03-03 10:31:26,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:25" (1/1) ... [2025-03-03 10:31:26,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:31:26,132 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:31:26,132 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:31:26,132 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:31:26,133 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:25" (1/1) ... [2025-03-03 10:31:26,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:31:26,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:31:26,156 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-03 10:31:26,159 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-03 10:31:26,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:31:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:31:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:31:26,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:31:26,219 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:31:26,220 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:31:27,374 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-03 10:31:27,374 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:31:27,387 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:31:27,389 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:31:27,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:27 BoogieIcfgContainer [2025-03-03 10:31:27,390 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:31:27,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:31:27,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:31:27,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:31:27,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:31:25" (1/3) ... [2025-03-03 10:31:27,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f08047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:31:27, skipping insertion in model container [2025-03-03 10:31:27,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:25" (2/3) ... [2025-03-03 10:31:27,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f08047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:31:27, skipping insertion in model container [2025-03-03 10:31:27,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:27" (3/3) ... [2025-03-03 10:31:27,397 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label05.c [2025-03-03 10:31:27,408 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:31:27,409 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label05.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:31:27,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:31:27,485 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;@29461a37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:31:27,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:31:27,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 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-03 10:31:27,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 10:31:27,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:27,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:27,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:27,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:27,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2110101337, now seen corresponding path program 1 times [2025-03-03 10:31:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:27,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490939371] [2025-03-03 10:31:27,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:27,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:27,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 10:31:27,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 10:31:27,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:27,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:27,835 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-03 10:31:27,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:27,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490939371] [2025-03-03 10:31:27,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490939371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:27,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:27,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:31:27,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439481700] [2025-03-03 10:31:27,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:27,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:27,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:27,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:27,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:27,860 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-03 10:31:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:28,713 INFO L93 Difference]: Finished difference Result 761 states and 1342 transitions. [2025-03-03 10:31:28,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:28,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-03 10:31:28,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:28,724 INFO L225 Difference]: With dead ends: 761 [2025-03-03 10:31:28,724 INFO L226 Difference]: Without dead ends: 413 [2025-03-03 10:31:28,727 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-03 10:31:28,729 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 164 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:28,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:31:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-03 10:31:28,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-03-03 10:31:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 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-03 10:31:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2025-03-03 10:31:28,771 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 64 [2025-03-03 10:31:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:28,771 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2025-03-03 10:31:28,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-03 10:31:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2025-03-03 10:31:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 10:31:28,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:28,774 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 10:31:28,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:31:28,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:28,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash -616546564, now seen corresponding path program 1 times [2025-03-03 10:31:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:28,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938599820] [2025-03-03 10:31:28,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:28,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:28,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 10:31:28,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 10:31:28,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:28,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:28,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:28,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938599820] [2025-03-03 10:31:28,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938599820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:28,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:28,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:31:28,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632627997] [2025-03-03 10:31:28,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:28,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:28,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:28,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:28,979 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 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-03 10:31:29,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:29,605 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2025-03-03 10:31:29,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:29,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-03-03 10:31:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:29,608 INFO L225 Difference]: With dead ends: 1211 [2025-03-03 10:31:29,609 INFO L226 Difference]: Without dead ends: 800 [2025-03-03 10:31:29,610 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-03 10:31:29,610 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:29,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 119 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:29,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-03 10:31:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2025-03-03 10:31:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-03 10:31:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2025-03-03 10:31:29,631 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 132 [2025-03-03 10:31:29,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:29,635 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2025-03-03 10:31:29,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 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-03 10:31:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2025-03-03 10:31:29,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 10:31:29,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:29,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 10:31:29,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:31:29,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:29,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1894368884, now seen corresponding path program 1 times [2025-03-03 10:31:29,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:29,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101968034] [2025-03-03 10:31:29,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:29,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:29,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 10:31:29,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 10:31:29,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:29,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:30,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:30,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101968034] [2025-03-03 10:31:30,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101968034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:30,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:30,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:30,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604274305] [2025-03-03 10:31:30,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:30,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:31:30,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:30,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:31:30,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:31:30,039 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-03 10:31:31,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:31,075 INFO L93 Difference]: Finished difference Result 2505 states and 3428 transitions. [2025-03-03 10:31:31,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:31:31,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-03-03 10:31:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:31,082 INFO L225 Difference]: With dead ends: 2505 [2025-03-03 10:31:31,082 INFO L226 Difference]: Without dead ends: 1718 [2025-03-03 10:31:31,083 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-03 10:31:31,085 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:31,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 218 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:31:31,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2025-03-03 10:31:31,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1714. [2025-03-03 10:31:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1713 states have (on average 1.2265032107413893) internal successors, (2101), 1713 states have internal predecessors, (2101), 0 states have call successors, (0), 0 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-03 10:31:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2101 transitions. [2025-03-03 10:31:31,111 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2101 transitions. Word has length 133 [2025-03-03 10:31:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:31,111 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2101 transitions. [2025-03-03 10:31:31,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-03 10:31:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2101 transitions. [2025-03-03 10:31:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 10:31:31,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:31,113 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:31,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:31:31,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:31,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:31,114 INFO L85 PathProgramCache]: Analyzing trace with hash 747631338, now seen corresponding path program 1 times [2025-03-03 10:31:31,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:31,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818563880] [2025-03-03 10:31:31,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:31,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:31,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 10:31:31,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 10:31:31,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:31,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:31,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:31,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818563880] [2025-03-03 10:31:31,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818563880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:31,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:31,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:31,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051642323] [2025-03-03 10:31:31,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:31,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:31,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:31,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:31,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:31,320 INFO L87 Difference]: Start difference. First operand 1714 states and 2101 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 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-03 10:31:31,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:31,886 INFO L93 Difference]: Finished difference Result 4005 states and 5048 transitions. [2025-03-03 10:31:31,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:31,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 191 [2025-03-03 10:31:31,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:31,893 INFO L225 Difference]: With dead ends: 4005 [2025-03-03 10:31:31,893 INFO L226 Difference]: Without dead ends: 2477 [2025-03-03 10:31:31,895 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-03 10:31:31,896 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 171 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:31,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:31:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2025-03-03 10:31:31,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2474. [2025-03-03 10:31:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2473 states have (on average 1.2308936514355033) internal successors, (3044), 2473 states have internal predecessors, (3044), 0 states have call successors, (0), 0 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-03 10:31:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3044 transitions. [2025-03-03 10:31:31,931 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3044 transitions. Word has length 191 [2025-03-03 10:31:31,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:31,931 INFO L471 AbstractCegarLoop]: Abstraction has 2474 states and 3044 transitions. [2025-03-03 10:31:31,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 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-03 10:31:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3044 transitions. [2025-03-03 10:31:31,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-03 10:31:31,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:31,934 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:31:31,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:31:31,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:31,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:31,934 INFO L85 PathProgramCache]: Analyzing trace with hash 773111449, now seen corresponding path program 1 times [2025-03-03 10:31:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:31,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533946669] [2025-03-03 10:31:31,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:31,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:31,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-03 10:31:31,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-03 10:31:31,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:31,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:32,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:32,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533946669] [2025-03-03 10:31:32,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533946669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:32,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:32,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:32,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489656496] [2025-03-03 10:31:32,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:32,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:32,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:32,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:32,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:32,149 INFO L87 Difference]: Start difference. First operand 2474 states and 3044 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 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-03 10:31:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:32,744 INFO L93 Difference]: Finished difference Result 5885 states and 7350 transitions. [2025-03-03 10:31:32,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:32,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2025-03-03 10:31:32,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:32,754 INFO L225 Difference]: With dead ends: 5885 [2025-03-03 10:31:32,754 INFO L226 Difference]: Without dead ends: 3597 [2025-03-03 10:31:32,757 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-03 10:31:32,759 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:32,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 339 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2025-03-03 10:31:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3397. [2025-03-03 10:31:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.2105418138987043) internal successors, (4111), 3396 states have internal predecessors, (4111), 0 states have call successors, (0), 0 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-03 10:31:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4111 transitions. [2025-03-03 10:31:32,809 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4111 transitions. Word has length 244 [2025-03-03 10:31:32,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:32,810 INFO L471 AbstractCegarLoop]: Abstraction has 3397 states and 4111 transitions. [2025-03-03 10:31:32,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 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-03 10:31:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4111 transitions. [2025-03-03 10:31:32,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-03 10:31:32,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:32,814 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:31:32,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:31:32,814 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:32,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:32,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2024094327, now seen corresponding path program 1 times [2025-03-03 10:31:32,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:32,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284377068] [2025-03-03 10:31:32,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:32,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:32,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-03 10:31:32,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-03 10:31:32,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:32,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 10:31:32,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:32,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284377068] [2025-03-03 10:31:32,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284377068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:32,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:32,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:32,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249158110] [2025-03-03 10:31:32,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:32,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:32,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:32,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:32,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:32,999 INFO L87 Difference]: Start difference. First operand 3397 states and 4111 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-03 10:31:33,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:33,546 INFO L93 Difference]: Finished difference Result 7359 states and 8963 transitions. [2025-03-03 10:31:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:33,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 245 [2025-03-03 10:31:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:33,557 INFO L225 Difference]: With dead ends: 7359 [2025-03-03 10:31:33,557 INFO L226 Difference]: Without dead ends: 3964 [2025-03-03 10:31:33,561 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-03 10:31:33,561 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 138 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:33,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 346 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:31:33,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2025-03-03 10:31:33,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 3949. [2025-03-03 10:31:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3949 states, 3948 states have (on average 1.2099797365754812) internal successors, (4777), 3948 states have internal predecessors, (4777), 0 states have call successors, (0), 0 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-03 10:31:33,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 4777 transitions. [2025-03-03 10:31:33,633 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 4777 transitions. Word has length 245 [2025-03-03 10:31:33,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:33,633 INFO L471 AbstractCegarLoop]: Abstraction has 3949 states and 4777 transitions. [2025-03-03 10:31:33,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-03 10:31:33,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 4777 transitions. [2025-03-03 10:31:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-03 10:31:33,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:33,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:33,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:31:33,636 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:33,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:33,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1817716204, now seen corresponding path program 1 times [2025-03-03 10:31:33,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:33,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434624077] [2025-03-03 10:31:33,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:33,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:33,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-03 10:31:33,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-03 10:31:33,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:33,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 10:31:33,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:33,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434624077] [2025-03-03 10:31:33,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434624077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:33,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:33,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:33,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829008615] [2025-03-03 10:31:33,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:33,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:33,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:33,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:33,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:33,814 INFO L87 Difference]: Start difference. First operand 3949 states and 4777 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-03 10:31:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:34,464 INFO L93 Difference]: Finished difference Result 8827 states and 10787 transitions. [2025-03-03 10:31:34,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:34,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 246 [2025-03-03 10:31:34,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:34,478 INFO L225 Difference]: With dead ends: 8827 [2025-03-03 10:31:34,478 INFO L226 Difference]: Without dead ends: 4880 [2025-03-03 10:31:34,482 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-03 10:31:34,483 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 133 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:34,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 379 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:34,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2025-03-03 10:31:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4869. [2025-03-03 10:31:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 1.1949465899753493) internal successors, (5817), 4868 states have internal predecessors, (5817), 0 states have call successors, (0), 0 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-03 10:31:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 5817 transitions. [2025-03-03 10:31:34,547 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 5817 transitions. Word has length 246 [2025-03-03 10:31:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:34,548 INFO L471 AbstractCegarLoop]: Abstraction has 4869 states and 5817 transitions. [2025-03-03 10:31:34,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-03 10:31:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 5817 transitions. [2025-03-03 10:31:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-03 10:31:34,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:34,551 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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-03 10:31:34,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:31:34,551 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:34,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:34,551 INFO L85 PathProgramCache]: Analyzing trace with hash -147582750, now seen corresponding path program 1 times [2025-03-03 10:31:34,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:34,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577003875] [2025-03-03 10:31:34,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:34,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:34,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-03 10:31:34,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-03 10:31:34,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:34,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:34,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:34,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577003875] [2025-03-03 10:31:34,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577003875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:34,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:34,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:31:34,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880546863] [2025-03-03 10:31:34,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:34,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:31:34,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:34,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:31:34,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:31:34,871 INFO L87 Difference]: Start difference. First operand 4869 states and 5817 transitions. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 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-03 10:31:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:35,881 INFO L93 Difference]: Finished difference Result 15489 states and 18737 transitions. [2025-03-03 10:31:35,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:31:35,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 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 266 [2025-03-03 10:31:35,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:35,907 INFO L225 Difference]: With dead ends: 15489 [2025-03-03 10:31:35,908 INFO L226 Difference]: Without dead ends: 10622 [2025-03-03 10:31:35,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:31:35,915 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 274 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:35,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 211 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:31:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10622 states. [2025-03-03 10:31:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10622 to 10248. [2025-03-03 10:31:36,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10248 states, 10247 states have (on average 1.1747828632770567) internal successors, (12038), 10247 states have internal predecessors, (12038), 0 states have call successors, (0), 0 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-03 10:31:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10248 states to 10248 states and 12038 transitions. [2025-03-03 10:31:36,063 INFO L78 Accepts]: Start accepts. Automaton has 10248 states and 12038 transitions. Word has length 266 [2025-03-03 10:31:36,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:36,064 INFO L471 AbstractCegarLoop]: Abstraction has 10248 states and 12038 transitions. [2025-03-03 10:31:36,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 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-03 10:31:36,065 INFO L276 IsEmpty]: Start isEmpty. Operand 10248 states and 12038 transitions. [2025-03-03 10:31:36,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-03 10:31:36,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:36,070 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:31:36,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:31:36,070 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:36,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:36,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1009625143, now seen corresponding path program 1 times [2025-03-03 10:31:36,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:36,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004057726] [2025-03-03 10:31:36,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:36,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:36,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-03 10:31:36,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 10:31:36,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:36,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:36,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:36,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004057726] [2025-03-03 10:31:36,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004057726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:36,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:36,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:31:36,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022152365] [2025-03-03 10:31:36,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:36,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:31:36,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:36,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:31:36,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:31:36,405 INFO L87 Difference]: Start difference. First operand 10248 states and 12038 transitions. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 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-03 10:31:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:37,431 INFO L93 Difference]: Finished difference Result 25302 states and 30140 transitions. [2025-03-03 10:31:37,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:31:37,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 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 276 [2025-03-03 10:31:37,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:37,458 INFO L225 Difference]: With dead ends: 25302 [2025-03-03 10:31:37,458 INFO L226 Difference]: Without dead ends: 15056 [2025-03-03 10:31:37,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:31:37,470 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 278 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:37,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 132 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:31:37,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15056 states. [2025-03-03 10:31:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15056 to 14673. [2025-03-03 10:31:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14673 states, 14672 states have (on average 1.1808887677208288) internal successors, (17326), 14672 states have internal predecessors, (17326), 0 states have call successors, (0), 0 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-03 10:31:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14673 states to 14673 states and 17326 transitions. [2025-03-03 10:31:37,643 INFO L78 Accepts]: Start accepts. Automaton has 14673 states and 17326 transitions. Word has length 276 [2025-03-03 10:31:37,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:37,644 INFO L471 AbstractCegarLoop]: Abstraction has 14673 states and 17326 transitions. [2025-03-03 10:31:37,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 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-03 10:31:37,644 INFO L276 IsEmpty]: Start isEmpty. Operand 14673 states and 17326 transitions. [2025-03-03 10:31:37,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-03 10:31:37,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:37,649 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:31:37,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:31:37,649 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:37,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:37,650 INFO L85 PathProgramCache]: Analyzing trace with hash -429354556, now seen corresponding path program 1 times [2025-03-03 10:31:37,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:37,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987481520] [2025-03-03 10:31:37,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:37,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:37,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-03 10:31:37,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 10:31:37,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:37,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 197 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:38,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:38,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987481520] [2025-03-03 10:31:38,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987481520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:31:38,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137211636] [2025-03-03 10:31:38,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:38,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:31:38,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:31:38,176 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-03 10:31:38,178 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-03 10:31:38,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-03 10:31:38,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 10:31:38,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:38,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:38,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 10:31:38,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:31:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 74 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:39,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:31:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 74 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:40,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137211636] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:31:40,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:31:40,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-03 10:31:40,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673166169] [2025-03-03 10:31:40,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:31:40,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 10:31:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:40,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 10:31:40,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 10:31:40,226 INFO L87 Difference]: Start difference. First operand 14673 states and 17326 transitions. Second operand has 11 states, 11 states have (on average 45.81818181818182) internal successors, (504), 10 states have internal predecessors, (504), 0 states have call successors, (0), 0 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-03 10:31:42,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:42,836 INFO L93 Difference]: Finished difference Result 31817 states and 38074 transitions. [2025-03-03 10:31:42,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 10:31:42,837 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 45.81818181818182) internal successors, (504), 10 states have internal predecessors, (504), 0 states have call successors, (0), 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 278 [2025-03-03 10:31:42,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:42,859 INFO L225 Difference]: With dead ends: 31817 [2025-03-03 10:31:42,859 INFO L226 Difference]: Without dead ends: 17134 [2025-03-03 10:31:42,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2025-03-03 10:31:42,869 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1220 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4757 mSolverCounterSat, 627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 5384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 4757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:42,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 153 Invalid, 5384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [627 Valid, 4757 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:31:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17134 states. [2025-03-03 10:31:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17134 to 15737. [2025-03-03 10:31:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15737 states, 15736 states have (on average 1.152325876970005) internal successors, (18133), 15736 states have internal predecessors, (18133), 0 states have call successors, (0), 0 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-03 10:31:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15737 states to 15737 states and 18133 transitions. [2025-03-03 10:31:43,013 INFO L78 Accepts]: Start accepts. Automaton has 15737 states and 18133 transitions. Word has length 278 [2025-03-03 10:31:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:43,014 INFO L471 AbstractCegarLoop]: Abstraction has 15737 states and 18133 transitions. [2025-03-03 10:31:43,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 45.81818181818182) internal successors, (504), 10 states have internal predecessors, (504), 0 states have call successors, (0), 0 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-03 10:31:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 15737 states and 18133 transitions. [2025-03-03 10:31:43,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-03 10:31:43,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:43,019 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:31:43,028 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-03 10:31:43,219 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,SelfDestructingSolverStorable9 [2025-03-03 10:31:43,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:43,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:43,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1371446559, now seen corresponding path program 1 times [2025-03-03 10:31:43,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:43,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937000444] [2025-03-03 10:31:43,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:43,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:43,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-03 10:31:43,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-03 10:31:43,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:43,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:43,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:43,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937000444] [2025-03-03 10:31:43,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937000444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:43,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:43,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:43,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949359072] [2025-03-03 10:31:43,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:43,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:31:43,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:43,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:31:43,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:31:43,496 INFO L87 Difference]: Start difference. First operand 15737 states and 18133 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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-03 10:31:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:44,261 INFO L93 Difference]: Finished difference Result 30520 states and 35154 transitions. [2025-03-03 10:31:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:31:44,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 297 [2025-03-03 10:31:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:44,278 INFO L225 Difference]: With dead ends: 30520 [2025-03-03 10:31:44,278 INFO L226 Difference]: Without dead ends: 14601 [2025-03-03 10:31:44,289 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-03 10:31:44,290 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 205 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:44,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 150 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:31:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2025-03-03 10:31:44,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 12937. [2025-03-03 10:31:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12937 states, 12936 states have (on average 1.1011904761904763) internal successors, (14245), 12936 states have internal predecessors, (14245), 0 states have call successors, (0), 0 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-03 10:31:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12937 states to 12937 states and 14245 transitions. [2025-03-03 10:31:44,416 INFO L78 Accepts]: Start accepts. Automaton has 12937 states and 14245 transitions. Word has length 297 [2025-03-03 10:31:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:44,417 INFO L471 AbstractCegarLoop]: Abstraction has 12937 states and 14245 transitions. [2025-03-03 10:31:44,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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-03 10:31:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 12937 states and 14245 transitions. [2025-03-03 10:31:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-03 10:31:44,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:44,425 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:31:44,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:31:44,426 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:44,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1495634003, now seen corresponding path program 1 times [2025-03-03 10:31:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:44,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897748973] [2025-03-03 10:31:44,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:44,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-03 10:31:44,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-03 10:31:44,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:44,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 199 proven. 160 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:31:44,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:44,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897748973] [2025-03-03 10:31:44,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897748973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:31:44,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625115312] [2025-03-03 10:31:44,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:44,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:31:44,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:31:44,982 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-03 10:31:44,982 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-03 10:31:45,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-03 10:31:45,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-03 10:31:45,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:45,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:45,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:31:45,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:31:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:31:45,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:31:45,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625115312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:45,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:31:45,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-03 10:31:45,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426411424] [2025-03-03 10:31:45,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:45,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:31:45,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:45,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:31:45,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:31:45,427 INFO L87 Difference]: Start difference. First operand 12937 states and 14245 transitions. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-03 10:31:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:46,054 INFO L93 Difference]: Finished difference Result 26243 states and 28871 transitions. [2025-03-03 10:31:46,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:31:46,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 351 [2025-03-03 10:31:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:46,068 INFO L225 Difference]: With dead ends: 26243 [2025-03-03 10:31:46,069 INFO L226 Difference]: Without dead ends: 13308 [2025-03-03 10:31:46,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:31:46,079 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 191 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:46,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 161 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:46,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13308 states. [2025-03-03 10:31:46,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13308 to 12385. [2025-03-03 10:31:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12385 states, 12384 states have (on average 1.1013404392764858) internal successors, (13639), 12384 states have internal predecessors, (13639), 0 states have call successors, (0), 0 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-03 10:31:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12385 states to 12385 states and 13639 transitions. [2025-03-03 10:31:46,219 INFO L78 Accepts]: Start accepts. Automaton has 12385 states and 13639 transitions. Word has length 351 [2025-03-03 10:31:46,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:46,220 INFO L471 AbstractCegarLoop]: Abstraction has 12385 states and 13639 transitions. [2025-03-03 10:31:46,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-03 10:31:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 12385 states and 13639 transitions. [2025-03-03 10:31:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-03 10:31:46,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:46,226 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:31:46,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:31:46,426 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,SelfDestructingSolverStorable11 [2025-03-03 10:31:46,426 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:46,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:46,427 INFO L85 PathProgramCache]: Analyzing trace with hash 368660832, now seen corresponding path program 1 times [2025-03-03 10:31:46,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:46,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178110226] [2025-03-03 10:31:46,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:46,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:46,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-03 10:31:46,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-03 10:31:46,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:46,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 123 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:46,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:46,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178110226] [2025-03-03 10:31:46,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178110226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:31:46,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698398769] [2025-03-03 10:31:46,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:46,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:31:46,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:31:46,702 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-03 10:31:46,704 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-03 10:31:46,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-03 10:31:46,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-03 10:31:46,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:46,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:46,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:31:46,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:31:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 123 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:47,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:31:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 123 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:48,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698398769] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:31:48,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:31:48,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-03-03 10:31:48,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820357960] [2025-03-03 10:31:48,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:31:48,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 10:31:48,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:48,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 10:31:48,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:31:48,243 INFO L87 Difference]: Start difference. First operand 12385 states and 13639 transitions. Second operand has 10 states, 10 states have (on average 78.8) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-03 10:31:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:50,182 INFO L93 Difference]: Finished difference Result 39506 states and 43331 transitions. [2025-03-03 10:31:50,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 10:31:50,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 78.8) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 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 362 [2025-03-03 10:31:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:50,209 INFO L225 Difference]: With dead ends: 39506 [2025-03-03 10:31:50,209 INFO L226 Difference]: Without dead ends: 26939 [2025-03-03 10:31:50,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:31:50,220 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 809 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3266 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 3623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 3266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:50,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 128 Invalid, 3623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 3266 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:31:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26939 states. [2025-03-03 10:31:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26939 to 24356. [2025-03-03 10:31:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24356 states, 24355 states have (on average 1.0910695955655922) internal successors, (26573), 24355 states have internal predecessors, (26573), 0 states have call successors, (0), 0 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-03 10:31:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24356 states to 24356 states and 26573 transitions. [2025-03-03 10:31:50,495 INFO L78 Accepts]: Start accepts. Automaton has 24356 states and 26573 transitions. Word has length 362 [2025-03-03 10:31:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:50,496 INFO L471 AbstractCegarLoop]: Abstraction has 24356 states and 26573 transitions. [2025-03-03 10:31:50,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 78.8) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-03 10:31:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 24356 states and 26573 transitions. [2025-03-03 10:31:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-03 10:31:50,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:50,503 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-03 10:31:50,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:31:50,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:31:50,703 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:50,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:50,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2100332154, now seen corresponding path program 1 times [2025-03-03 10:31:50,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:50,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709870306] [2025-03-03 10:31:50,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:50,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:50,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-03 10:31:50,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-03 10:31:50,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:50,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 370 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:51,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:51,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709870306] [2025-03-03 10:31:51,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709870306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:31:51,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471552549] [2025-03-03 10:31:51,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:51,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:31:51,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:31:51,146 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-03 10:31:51,148 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-03 10:31:51,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-03 10:31:51,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-03 10:31:51,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:51,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:51,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 10:31:51,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:31:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 96 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:54,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:31:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 370 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:55,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471552549] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:31:55,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:31:55,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-03 10:31:55,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146601146] [2025-03-03 10:31:55,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:31:55,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 10:31:55,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:55,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 10:31:55,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-03 10:31:55,558 INFO L87 Difference]: Start difference. First operand 24356 states and 26573 transitions. Second operand has 12 states, 12 states have (on average 82.91666666666667) internal successors, (995), 12 states have internal predecessors, (995), 0 states have call successors, (0), 0 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-03 10:32:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:00,008 INFO L93 Difference]: Finished difference Result 60873 states and 66520 transitions. [2025-03-03 10:32:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 10:32:00,008 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 82.91666666666667) internal successors, (995), 12 states have internal predecessors, (995), 0 states have call successors, (0), 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 373 [2025-03-03 10:32:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:00,045 INFO L225 Difference]: With dead ends: 60873 [2025-03-03 10:32:00,045 INFO L226 Difference]: Without dead ends: 36335 [2025-03-03 10:32:00,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2025-03-03 10:32:00,064 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 3139 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 5200 mSolverCounterSat, 966 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3139 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 966 IncrementalHoareTripleChecker+Valid, 5200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:00,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3139 Valid, 145 Invalid, 6166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [966 Valid, 5200 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 10:32:00,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36335 states. [2025-03-03 10:32:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36335 to 23616. [2025-03-03 10:32:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23616 states, 23615 states have (on average 1.0774084268473427) internal successors, (25443), 23615 states have internal predecessors, (25443), 0 states have call successors, (0), 0 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-03 10:32:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23616 states to 23616 states and 25443 transitions. [2025-03-03 10:32:00,346 INFO L78 Accepts]: Start accepts. Automaton has 23616 states and 25443 transitions. Word has length 373 [2025-03-03 10:32:00,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:00,347 INFO L471 AbstractCegarLoop]: Abstraction has 23616 states and 25443 transitions. [2025-03-03 10:32:00,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 82.91666666666667) internal successors, (995), 12 states have internal predecessors, (995), 0 states have call successors, (0), 0 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-03 10:32:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 23616 states and 25443 transitions. [2025-03-03 10:32:00,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-03 10:32:00,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:00,357 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 10:32:00,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 10:32:00,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:00,557 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:00,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1099104655, now seen corresponding path program 1 times [2025-03-03 10:32:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:00,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741208451] [2025-03-03 10:32:00,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:00,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-03 10:32:00,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-03 10:32:00,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:00,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:00,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:00,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741208451] [2025-03-03 10:32:00,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741208451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:00,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:00,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:32:00,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627502862] [2025-03-03 10:32:00,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:00,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:32:00,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:00,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:32:00,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:32:00,894 INFO L87 Difference]: Start difference. First operand 23616 states and 25443 transitions. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 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-03 10:32:01,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:01,975 INFO L93 Difference]: Finished difference Result 52394 states and 56386 transitions. [2025-03-03 10:32:01,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:32:01,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 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 459 [2025-03-03 10:32:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:02,003 INFO L225 Difference]: With dead ends: 52394 [2025-03-03 10:32:02,003 INFO L226 Difference]: Without dead ends: 28964 [2025-03-03 10:32:02,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:32:02,021 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 323 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:02,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 74 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:32:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28964 states. [2025-03-03 10:32:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28964 to 24356. [2025-03-03 10:32:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24356 states, 24355 states have (on average 1.0759597618558818) internal successors, (26205), 24355 states have internal predecessors, (26205), 0 states have call successors, (0), 0 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-03 10:32:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24356 states to 24356 states and 26205 transitions. [2025-03-03 10:32:02,261 INFO L78 Accepts]: Start accepts. Automaton has 24356 states and 26205 transitions. Word has length 459 [2025-03-03 10:32:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:02,261 INFO L471 AbstractCegarLoop]: Abstraction has 24356 states and 26205 transitions. [2025-03-03 10:32:02,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 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-03 10:32:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 24356 states and 26205 transitions. [2025-03-03 10:32:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-03-03 10:32:02,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:02,277 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:32:02,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:32:02,277 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:02,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:02,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1743892131, now seen corresponding path program 1 times [2025-03-03 10:32:02,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:02,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444079905] [2025-03-03 10:32:02,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:02,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:02,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-03-03 10:32:02,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-03-03 10:32:02,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:02,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 745 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 10:32:02,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:02,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444079905] [2025-03-03 10:32:02,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444079905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:02,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:02,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:32:02,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662866327] [2025-03-03 10:32:02,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:02,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:32:02,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:02,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:32:02,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:32:02,681 INFO L87 Difference]: Start difference. First operand 24356 states and 26205 transitions. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 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-03 10:32:03,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:03,682 INFO L93 Difference]: Finished difference Result 50558 states and 54340 transitions. [2025-03-03 10:32:03,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:32:03,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 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 548 [2025-03-03 10:32:03,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:03,706 INFO L225 Difference]: With dead ends: 50558 [2025-03-03 10:32:03,706 INFO L226 Difference]: Without dead ends: 26388 [2025-03-03 10:32:03,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:32:03,718 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 430 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:03,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 53 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:32:03,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26388 states. [2025-03-03 10:32:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26388 to 20856. [2025-03-03 10:32:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20856 states, 20855 states have (on average 1.0759530088707745) internal successors, (22439), 20855 states have internal predecessors, (22439), 0 states have call successors, (0), 0 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-03 10:32:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20856 states to 20856 states and 22439 transitions. [2025-03-03 10:32:03,942 INFO L78 Accepts]: Start accepts. Automaton has 20856 states and 22439 transitions. Word has length 548 [2025-03-03 10:32:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:03,942 INFO L471 AbstractCegarLoop]: Abstraction has 20856 states and 22439 transitions. [2025-03-03 10:32:03,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 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-03 10:32:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 20856 states and 22439 transitions. [2025-03-03 10:32:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-03 10:32:03,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:03,958 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:03,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:32:03,959 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:03,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash -559334575, now seen corresponding path program 1 times [2025-03-03 10:32:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:03,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646402928] [2025-03-03 10:32:03,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:03,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-03 10:32:04,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-03 10:32:04,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:04,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1270 backedges. 557 proven. 651 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 10:32:04,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:04,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646402928] [2025-03-03 10:32:04,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646402928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:04,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899634903] [2025-03-03 10:32:04,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:04,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:04,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:04,998 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-03 10:32:04,999 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-03 10:32:05,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-03 10:32:05,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-03 10:32:05,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:05,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:05,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:32:05,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1270 backedges. 777 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2025-03-03 10:32:05,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:32:05,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899634903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:05,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:32:05,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-03 10:32:05,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120735776] [2025-03-03 10:32:05,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:05,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:05,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:05,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:05,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:32:05,345 INFO L87 Difference]: Start difference. First operand 20856 states and 22439 transitions. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 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-03 10:32:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:05,790 INFO L93 Difference]: Finished difference Result 42093 states and 45287 transitions. [2025-03-03 10:32:05,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:05,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 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 693 [2025-03-03 10:32:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:05,811 INFO L225 Difference]: With dead ends: 42093 [2025-03-03 10:32:05,811 INFO L226 Difference]: Without dead ends: 21423 [2025-03-03 10:32:05,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:32:05,822 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 104 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:05,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 313 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21423 states. [2025-03-03 10:32:05,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21423 to 21230. [2025-03-03 10:32:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21230 states, 21229 states have (on average 1.0742380705638512) internal successors, (22805), 21229 states have internal predecessors, (22805), 0 states have call successors, (0), 0 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-03 10:32:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21230 states to 21230 states and 22805 transitions. [2025-03-03 10:32:06,015 INFO L78 Accepts]: Start accepts. Automaton has 21230 states and 22805 transitions. Word has length 693 [2025-03-03 10:32:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:06,016 INFO L471 AbstractCegarLoop]: Abstraction has 21230 states and 22805 transitions. [2025-03-03 10:32:06,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 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-03 10:32:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 21230 states and 22805 transitions. [2025-03-03 10:32:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-03-03 10:32:06,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:06,033 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:06,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 10:32:06,233 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,SelfDestructingSolverStorable16 [2025-03-03 10:32:06,233 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:06,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:06,234 INFO L85 PathProgramCache]: Analyzing trace with hash -497540732, now seen corresponding path program 1 times [2025-03-03 10:32:06,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:06,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235116051] [2025-03-03 10:32:06,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:06,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:06,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-03-03 10:32:06,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-03-03 10:32:06,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:06,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 186 proven. 942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:07,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:07,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235116051] [2025-03-03 10:32:07,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235116051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:07,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106640869] [2025-03-03 10:32:07,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:07,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:07,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:07,219 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-03 10:32:07,220 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-03 10:32:07,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-03-03 10:32:07,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-03-03 10:32:07,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:07,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:07,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 10:32:07,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 62 proven. 1066 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:07,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:32:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 771 proven. 233 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 10:32:11,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106640869] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:32:11,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:32:11,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 17 [2025-03-03 10:32:11,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62103181] [2025-03-03 10:32:11,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:32:11,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 10:32:11,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:11,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 10:32:11,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-03-03 10:32:11,370 INFO L87 Difference]: Start difference. First operand 21230 states and 22805 transitions. Second operand has 17 states, 17 states have (on average 117.05882352941177) internal successors, (1990), 17 states have internal predecessors, (1990), 0 states have call successors, (0), 0 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-03 10:32:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:15,775 INFO L93 Difference]: Finished difference Result 77125 states and 82798 transitions. [2025-03-03 10:32:15,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 10:32:15,775 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 117.05882352941177) internal successors, (1990), 17 states have internal predecessors, (1990), 0 states have call successors, (0), 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 705 [2025-03-03 10:32:15,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:15,777 INFO L225 Difference]: With dead ends: 77125 [2025-03-03 10:32:15,777 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:32:15,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1434 GetRequests, 1409 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2025-03-03 10:32:15,801 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 2119 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 7922 mSolverCounterSat, 980 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2119 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 8902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 980 IncrementalHoareTripleChecker+Valid, 7922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:15,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2119 Valid, 255 Invalid, 8902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [980 Valid, 7922 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 10:32:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:32:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:32:15,802 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-03 10:32:15,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:32:15,802 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 705 [2025-03-03 10:32:15,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:15,802 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:32:15,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 117.05882352941177) internal successors, (1990), 17 states have internal predecessors, (1990), 0 states have call successors, (0), 0 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-03 10:32:15,803 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:32:15,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:32:15,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:32:15,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 10:32:16,007 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,SelfDestructingSolverStorable17 [2025-03-03 10:32:16,010 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:16,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:32:38,811 WARN L286 SmtUtils]: Spent 22.79s on a formula simplification. DAG size of input: 873 DAG size of output: 973 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-03 10:32:45,554 WARN L286 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 973 DAG size of output: 139 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-03-03 10:32:45,558 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:32:45,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:32:45 BoogieIcfgContainer [2025-03-03 10:32:45,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:32:45,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:32:45,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:32:45,603 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:32:45,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:27" (3/4) ... [2025-03-03 10:32:45,605 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:32:45,628 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:32:45,629 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:32:45,630 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:32:45,631 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:32:45,759 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:32:45,759 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:32:45,759 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:32:45,760 INFO L158 Benchmark]: Toolchain (without parser) took 80278.09ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 109.9MB in the beginning and 912.6MB in the end (delta: -802.7MB). Peak memory consumption was 251.9MB. Max. memory is 16.1GB. [2025-03-03 10:32:45,760 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:32:45,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.92ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 67.0MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 10:32:45,761 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.72ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 50.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:32:45,761 INFO L158 Benchmark]: Boogie Preprocessor took 144.57ms. Allocated memory is still 142.6MB. Free memory was 50.2MB in the beginning and 89.0MB in the end (delta: -38.8MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2025-03-03 10:32:45,761 INFO L158 Benchmark]: IcfgBuilder took 1257.91ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 39.7MB in the end (delta: 49.3MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2025-03-03 10:32:45,762 INFO L158 Benchmark]: TraceAbstraction took 78210.95ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 38.8MB in the beginning and 933.6MB in the end (delta: -894.7MB). Peak memory consumption was 791.0MB. Max. memory is 16.1GB. [2025-03-03 10:32:45,762 INFO L158 Benchmark]: Witness Printer took 156.27ms. Allocated memory is still 1.2GB. Free memory was 933.6MB in the beginning and 912.6MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:32:45,762 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.92ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 67.0MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.72ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 50.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 144.57ms. Allocated memory is still 142.6MB. Free memory was 50.2MB in the beginning and 89.0MB in the end (delta: -38.8MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1257.91ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 39.7MB in the end (delta: 49.3MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. * TraceAbstraction took 78210.95ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 38.8MB in the beginning and 933.6MB in the end (delta: -894.7MB). Peak memory consumption was 791.0MB. Max. memory is 16.1GB. * Witness Printer took 156.27ms. Allocated memory is still 1.2GB. Free memory was 933.6MB in the beginning and 912.6MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 208]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.6s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10464 SdHoareTripleChecker+Valid, 21.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10464 mSDsluCounter, 3721 SdHoareTripleChecker+Invalid, 18.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 973 mSDsCounter, 4606 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32749 IncrementalHoareTripleChecker+Invalid, 37355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4606 mSolverCounterUnsat, 2748 mSDtfsCounter, 32749 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4595 GetRequests, 4491 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24356occurred in iteration=13, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 30620 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 8625 NumberOfCodeBlocks, 8625 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 10315 ConstructedInterpolants, 152 QuantifiedInterpolants, 70572 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3612 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 8055/12305 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: 1044]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((a25 == 13) && (a29 <= 275)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (130 <= a29)) || ((((((((((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0)) && (a29 <= 599998)) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a4 == 1)) && (a8 == 15)) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (0 <= ((long long) a23 + 42))) && ((a25 == 13) || (a25 == 12)))) || (((((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && ((a25 == 13) || (a25 == 12)))) || (((((((((long long) 275921 + a29) <= 0) && (0 <= ((long long) 909625 + a23))) && (a4 == 0)) && (a25 == 9)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((((((((((a29 <= 275) && ((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && ((((a23 >= 0) ? (a23 % 5) : ((a23 % 5) + 5)) != 0) || (0 < (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942)))) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a4 == 1)) && (a25 <= 9)) && (a8 == 15)) && (246 <= a29)) && (0 <= (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942))) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))))) || (((((((long long) a29 + 275824) <= 0) && (a25 == 9)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((((a4 == 0) && ((((a23 >= 0) ? (a23 % 5) : ((a23 % 5) + 5)) != 0) || (0 < (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942)))) && (a29 <= 599998)) && (a25 == 9)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (246 <= a29)) && (0 <= (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942)))) || ((((((((0 <= ((long long) a23 + 599772)) && (a4 == 0)) && (a25 == 11)) && (a29 <= 599998)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (246 <= a29))) || ((((((((long long) a23 + 43) <= 0) && (a3 == 1)) && (a4 == 1)) && (214883 <= a29)) && (a8 == 15)) && (a25 == 10))) || ((((((((((0 <= ((long long) 909625 + a23)) && ((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (a29 <= 599999)) && (a25 == 9)) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a4 == 1)) && (a8 == 15)) && (246 <= a29)) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))))) || ((((((((0 <= ((long long) a23 + 599772)) && (a29 <= 140)) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) || ((((((0 <= ((long long) a23 + 599772)) && (a4 == 0)) && (((long long) a29 + 275824) <= 0)) && (a25 == 9)) && (a3 == 1)) && (a8 == 15))) && (a23 <= 312))) || ((((((((((a29 <= 275) && ((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (a4 == 0)) && (0 <= ((long long) 386869 + a23))) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15)) && (246 <= a29)) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && ((a25 == 13) || (a25 == 12)))) || (((((((((long long) a23 + 43) <= 0) && (a29 <= 140)) && (a4 == 0)) && (a25 == 11)) && (0 <= ((long long) 386869 + a23))) && (a3 == 1)) && (a8 == 15))) || (((((((a25 == 11) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((((((((a29 <= 275) && (a25 == 12)) && (0 <= ((long long) 909625 + a23))) && ((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (a4 == 0)) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15)) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))))) || (((((((((a29 <= 275) && (a4 == 0)) && ((((a23 >= 0) ? (a23 % 5) : ((a23 % 5) + 5)) != 0) || (0 < (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942)))) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (246 <= a29)) && (0 <= (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942))) && ((a25 == 13) || (a25 == 12)))) || (((((((0 <= ((long long) 909625 + a23)) && (a4 == 0)) && (a25 == 11)) && (((long long) a29 + 22) <= 0)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((((((0 <= ((long long) 909625 + a23)) && (a25 == 11)) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (214883 <= a29)) && (a23 <= 312)) && (a8 == 15))) || ((((((((0 <= ((long long) 909625 + a23)) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (a25 <= 10)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (a25 != 9))) || (((((((a29 <= 140) && (a4 == 0)) && (a25 <= 10)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((((((((((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0)) && (a25 == 11)) && (a29 <= 599999)) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a4 == 1)) && (a8 == 15)) && (246 <= a29)) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (0 <= ((long long) a23 + 42)))) || ((((((((((181945 <= a23) && ((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (a25 == 11)) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15)) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (130 <= a29))) || ((((((((a29 <= 275) && (0 <= ((long long) a23 + 599772))) && (a25 == 11)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (246 <= a29))) || (((((((((long long) a23 + 43) <= 0) && (a25 == 12)) && (0 <= ((long long) a23 + 599772))) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a29 <= 130))) || (((((((((((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0)) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (a25 <= 10)) && (0 <= ((long long) 386869 + a23))) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15)) && (a25 != 9)) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))))) || ((((((a29 <= 140) && (a25 == 9)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((((((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0)) && (a25 <= 10)) && (a29 <= 599999)) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a4 == 1)) && (a8 == 15)) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (0 <= ((long long) a23 + 42)))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:32:45,783 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