/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-2modifiers.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:36,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:36,686 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:36,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:36,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:36,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:53:36,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:36,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:36,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:36,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:36,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:36,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:36,712 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:36,712 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:36,712 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:36,712 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:36,712 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:36,713 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:36,713 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:36,713 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:36,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:36,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:36,713 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:36,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:36,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:36,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:36,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:36,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:36,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:36,713 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:36,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:36,713 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:36,714 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:36,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:36,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:36,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:36,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:36,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:36,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:36,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:36,714 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:36,714 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:36,714 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:36,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:36,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:36,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:36,946 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:36,947 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:36,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-2modifiers.bpl [2025-04-26 16:53:36,951 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-2modifiers.bpl' [2025-04-26 16:53:36,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:36,973 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:36,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:36,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:36,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:36,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:36" (1/1) ... [2025-04-26 16:53:37,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:36" (1/1) ... [2025-04-26 16:53:37,016 INFO L138 Inliner]: procedures = 4, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:53:37,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:37,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:37,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:37,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:37,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:36" (1/1) ... [2025-04-26 16:53:37,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:36" (1/1) ... [2025-04-26 16:53:37,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:36" (1/1) ... [2025-04-26 16:53:37,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:36" (1/1) ... [2025-04-26 16:53:37,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:36" (1/1) ... [2025-04-26 16:53:37,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:36" (1/1) ... [2025-04-26 16:53:37,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:36" (1/1) ... [2025-04-26 16:53:37,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:36" (1/1) ... [2025-04-26 16:53:37,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:36" (1/1) ... [2025-04-26 16:53:37,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:37,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:37,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:37,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:37,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:36" (1/1) ... [2025-04-26 16:53:37,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:37,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:37,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:37,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:53:37,141 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:53:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:53:37,142 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:53:37,142 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:53:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:53:37,142 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:53:37,142 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:53:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:53:37,142 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:53:37,142 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:37,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:37,143 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:53:37,190 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:37,192 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:37,281 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:37,281 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:37,289 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:37,289 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:53:37,289 INFO L201 PluginConnector]: Adding new model map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:37 BoogieIcfgContainer [2025-04-26 16:53:37,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:37,290 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:37,290 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:37,294 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:37,294 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:37,294 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:36" (1/2) ... [2025-04-26 16:53:37,295 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23ca7d9a and model type map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:37, skipping insertion in model container [2025-04-26 16:53:37,295 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:37,295 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:37" (2/2) ... [2025-04-26 16:53:37,296 INFO L376 chiAutomizerObserver]: Analyzing ICFG map-aggr-update1-2modifiers.bpl [2025-04-26 16:53:37,359 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:53:37,389 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:37,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:37,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:37,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:37,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:53:37,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 50 transitions, 128 flow [2025-04-26 16:53:37,475 INFO L116 PetriNetUnfolderBase]: 6/42 cut-off events. [2025-04-26 16:53:37,477 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:53:37,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 42 events. 6/42 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 101 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-26 16:53:37,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 50 transitions, 128 flow [2025-04-26 16:53:37,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 42 transitions, 108 flow [2025-04-26 16:53:37,485 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 49 places, 42 transitions, 108 flow [2025-04-26 16:53:37,491 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:37,938 WARN L140 AmpleReduction]: Number of pruned transitions: 3067 [2025-04-26 16:53:37,938 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:53:37,938 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 329 [2025-04-26 16:53:37,938 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:37 [2025-04-26 16:53:37,938 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:1058 [2025-04-26 16:53:37,939 WARN L145 AmpleReduction]: Times succ was already a loop node:192 [2025-04-26 16:53:37,939 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:674 [2025-04-26 16:53:37,939 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:37,945 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 1425 states, 1423 states have (on average 2.0210822206605763) internal successors, (in total 2876), 1424 states have internal predecessors, (2876), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:37,952 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:37,952 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:37,952 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:37,952 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:37,952 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:37,952 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:37,953 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:37,953 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:37,958 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1425 states, 1423 states have (on average 2.0210822206605763) internal successors, (in total 2876), 1424 states have internal predecessors, (2876), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:38,006 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 1101 [2025-04-26 16:53:38,006 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:38,007 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:38,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:38,012 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:38,012 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:38,014 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1425 states, 1423 states have (on average 2.0210822206605763) internal successors, (in total 2876), 1424 states have internal predecessors, (2876), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:38,033 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 1101 [2025-04-26 16:53:38,033 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:38,033 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:38,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:38,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:38,038 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" [2025-04-26 16:53:38,039 INFO L754 eck$LassoCheckResult]: Loop: "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" [2025-04-26 16:53:38,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:38,042 INFO L85 PathProgramCache]: Analyzing trace with hash 117427, now seen corresponding path program 1 times [2025-04-26 16:53:38,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:38,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526395855] [2025-04-26 16:53:38,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:38,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:38,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:38,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:38,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:38,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:38,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:38,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:38,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:38,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:38,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:38,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:38,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:38,133 INFO L85 PathProgramCache]: Analyzing trace with hash 123198, now seen corresponding path program 1 times [2025-04-26 16:53:38,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:38,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758127485] [2025-04-26 16:53:38,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:38,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:38,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:38,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:38,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:38,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:38,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:38,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:38,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:38,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:38,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:38,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:38,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:38,154 INFO L85 PathProgramCache]: Analyzing trace with hash -796606132, now seen corresponding path program 1 times [2025-04-26 16:53:38,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:38,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426719945] [2025-04-26 16:53:38,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:38,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:38,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:38,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:38,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:38,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:38,168 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:38,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:38,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:38,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:38,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:38,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:38,334 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:38,334 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:38,334 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:38,334 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:38,335 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:38,335 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:38,335 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:38,335 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:38,335 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-2modifiers.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:53:38,335 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:38,335 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:38,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:38,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:38,445 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:38,447 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:38,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:38,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:38,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:38,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:53:38,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:38,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:38,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:38,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:38,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:38,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:38,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:38,485 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:38,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:53:38,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:38,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:38,496 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:38,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:53:38,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:38,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:38,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:38,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:38,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:38,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:38,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:38,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:38,513 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:38,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:38,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:38,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:38,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:38,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:53:38,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:38,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:38,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:38,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:38,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:38,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:38,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:38,549 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:38,566 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:53:38,567 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:53:38,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:38,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:38,634 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:38,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:53:38,636 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:38,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:53:38,652 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:38,652 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:38,653 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_i, N) = -1*thread1Thread1of1ForFork1_i + 1*N Supporting invariants [] [2025-04-26 16:53:38,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:53:38,661 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:38,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:38,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:38,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:38,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:38,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:38,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:38,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:38,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:38,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:38,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:38,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:38,701 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:38,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:38,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:38,733 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:38,736 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 1425 states, 1423 states have (on average 2.0210822206605763) internal successors, (in total 2876), 1424 states have internal predecessors, (2876), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:38,884 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 1425 states, 1423 states have (on average 2.0210822206605763) internal successors, (in total 2876), 1424 states have internal predecessors, (2876), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3265 states and 6626 transitions. Complement of second has 6 states. [2025-04-26 16:53:38,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:38,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-04-26 16:53:38,893 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:53:38,893 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:38,893 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:53:38,893 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:38,893 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:53:38,893 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:38,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3265 states and 6626 transitions. [2025-04-26 16:53:38,918 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 261 [2025-04-26 16:53:38,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3265 states to 1860 states and 3651 transitions. [2025-04-26 16:53:38,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 473 [2025-04-26 16:53:38,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 875 [2025-04-26 16:53:38,944 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1860 states and 3651 transitions. [2025-04-26 16:53:38,945 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:38,945 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1860 states and 3651 transitions. [2025-04-26 16:53:38,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states and 3651 transitions. [2025-04-26 16:53:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1612. [2025-04-26 16:53:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1612 states have (on average 2.035980148883375) internal successors, (in total 3282), 1611 states have internal predecessors, (3282), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 3282 transitions. [2025-04-26 16:53:39,025 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1612 states and 3282 transitions. [2025-04-26 16:53:39,025 INFO L438 stractBuchiCegarLoop]: Abstraction has 1612 states and 3282 transitions. [2025-04-26 16:53:39,025 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:53:39,025 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1612 states and 3282 transitions. [2025-04-26 16:53:39,031 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 261 [2025-04-26 16:53:39,031 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:39,031 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:39,031 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:39,031 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:39,033 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[95] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" [2025-04-26 16:53:39,033 INFO L754 eck$LassoCheckResult]: Loop: "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[107] L68-2-->L71-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork2_j_13) 0) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[109] L71-1-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_16 (+ v_thread2Thread1of1ForFork2_j_15 1)) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_15} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" [2025-04-26 16:53:39,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:39,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1035232626, now seen corresponding path program 1 times [2025-04-26 16:53:39,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:39,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394751483] [2025-04-26 16:53:39,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:39,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:39,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:53:39,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:53:39,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:39,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:39,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:39,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394751483] [2025-04-26 16:53:39,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394751483] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:39,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:39,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:53:39,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264066407] [2025-04-26 16:53:39,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:39,099 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:39,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash 4035782, now seen corresponding path program 1 times [2025-04-26 16:53:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:39,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78882141] [2025-04-26 16:53:39,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:39,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:39,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:39,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:39,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:39,105 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:39,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:39,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:39,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:39,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:39,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:39,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:39,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:53:39,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:53:39,140 INFO L87 Difference]: Start difference. First operand 1612 states and 3282 transitions. cyclomatic complexity: 1774 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:39,258 INFO L93 Difference]: Finished difference Result 1612 states and 3281 transitions. [2025-04-26 16:53:39,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1612 states and 3281 transitions. [2025-04-26 16:53:39,268 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 261 [2025-04-26 16:53:39,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1612 states to 1612 states and 3281 transitions. [2025-04-26 16:53:39,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 627 [2025-04-26 16:53:39,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 627 [2025-04-26 16:53:39,284 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1612 states and 3281 transitions. [2025-04-26 16:53:39,284 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:39,284 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1612 states and 3281 transitions. [2025-04-26 16:53:39,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states and 3281 transitions. [2025-04-26 16:53:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1612. [2025-04-26 16:53:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1612 states have (on average 2.0353598014888337) internal successors, (in total 3281), 1611 states have internal predecessors, (3281), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 3281 transitions. [2025-04-26 16:53:39,325 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1612 states and 3281 transitions. [2025-04-26 16:53:39,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:53:39,326 INFO L438 stractBuchiCegarLoop]: Abstraction has 1612 states and 3281 transitions. [2025-04-26 16:53:39,326 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:53:39,326 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1612 states and 3281 transitions. [2025-04-26 16:53:39,332 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 261 [2025-04-26 16:53:39,332 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:39,332 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:39,333 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:39,333 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:39,334 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[95] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" [2025-04-26 16:53:39,335 INFO L754 eck$LassoCheckResult]: Loop: "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[107] L68-2-->L71-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork2_j_13) 0) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[109] L71-1-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_16 (+ v_thread2Thread1of1ForFork2_j_15 1)) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_15} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" [2025-04-26 16:53:39,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:39,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1069032555, now seen corresponding path program 1 times [2025-04-26 16:53:39,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:39,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789979870] [2025-04-26 16:53:39,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:39,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:39,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:39,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:39,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:39,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:39,347 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:39,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:39,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:39,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:39,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:39,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:39,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:39,358 INFO L85 PathProgramCache]: Analyzing trace with hash 4035782, now seen corresponding path program 2 times [2025-04-26 16:53:39,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:39,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6213411] [2025-04-26 16:53:39,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:39,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:39,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:39,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:39,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:39,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:39,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:39,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:39,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:39,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:39,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:39,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:39,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:39,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1531283034, now seen corresponding path program 1 times [2025-04-26 16:53:39,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:39,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559391485] [2025-04-26 16:53:39,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:39,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:39,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:39,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:39,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:39,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:39,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:39,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:39,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:39,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:39,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:39,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:39,543 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:39,543 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:39,543 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:39,543 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:39,543 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:39,543 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:39,543 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:39,543 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:39,543 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-2modifiers.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:53:39,543 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:39,543 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:39,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:39,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:39,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:39,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:39,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:39,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:39,785 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:39,785 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:39,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:39,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:39,787 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:39,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:53:39,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:39,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:39,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:39,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:39,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:39,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:39,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:39,806 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:39,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:39,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:39,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:39,816 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:39,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:53:39,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:39,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:39,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:39,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:39,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:39,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:39,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:39,832 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:39,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:39,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:39,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:39,840 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:39,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:53:39,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:39,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:39,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:39,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:39,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:39,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:39,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:39,857 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:39,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:39,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:39,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:39,866 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:39,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:53:39,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:39,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:39,879 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:53:39,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:39,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:39,882 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:53:39,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:39,886 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:39,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:53:39,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:39,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:39,894 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:39,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:53:39,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:39,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:39,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:39,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:39,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:39,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:39,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:39,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:39,925 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:39,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:53:39,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:39,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:39,935 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:39,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:53:39,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:39,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:39,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:39,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:39,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:39,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:39,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:39,956 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:39,964 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:53:39,964 INFO L437 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:53:39,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:39,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:39,966 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:39,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:53:39,968 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:39,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:53:39,985 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:39,985 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:39,986 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork2_j, N) = -1*thread2Thread1of1ForFork2_j + 1*N Supporting invariants [] [2025-04-26 16:53:39,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:39,992 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:40,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:40,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:40,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:40,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:40,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:40,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:40,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:40,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:40,031 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:40,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:40,057 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:40,057 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1612 states and 3281 transitions. cyclomatic complexity: 1773 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:40,147 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1612 states and 3281 transitions. cyclomatic complexity: 1773. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3453 states and 6965 transitions. Complement of second has 6 states. [2025-04-26 16:53:40,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-04-26 16:53:40,148 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:53:40,148 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:40,148 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:53:40,148 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:40,148 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 16:53:40,148 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:40,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3453 states and 6965 transitions. [2025-04-26 16:53:40,171 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 151 [2025-04-26 16:53:40,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3453 states to 2317 states and 4610 transitions. [2025-04-26 16:53:40,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 710 [2025-04-26 16:53:40,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 784 [2025-04-26 16:53:40,188 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2317 states and 4610 transitions. [2025-04-26 16:53:40,188 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:40,188 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2317 states and 4610 transitions. [2025-04-26 16:53:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states and 4610 transitions. [2025-04-26 16:53:40,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2250. [2025-04-26 16:53:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 2250 states have (on average 1.9937777777777779) internal successors, (in total 4486), 2249 states have internal predecessors, (4486), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 4486 transitions. [2025-04-26 16:53:40,228 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2250 states and 4486 transitions. [2025-04-26 16:53:40,228 INFO L438 stractBuchiCegarLoop]: Abstraction has 2250 states and 4486 transitions. [2025-04-26 16:53:40,228 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:53:40,228 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2250 states and 4486 transitions. [2025-04-26 16:53:40,237 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 151 [2025-04-26 16:53:40,237 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:40,237 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:40,237 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:40,237 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:40,238 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[95] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[100] L67-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork2_j_3) InVars {N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} OutVars{N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} AuxVars[] AssignedVars[]" "[102] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[133] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_k]" "[110] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork3_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" [2025-04-26 16:53:40,238 INFO L754 eck$LassoCheckResult]: Loop: "[112] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork3_k_5 v_N_5) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[114] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork3_k_7 v_thread3Thread1of1ForFork3_k_7) v_B_3) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[115] L87-->L85-1: Formula: (= (+ v_thread3Thread1of1ForFork3_k_9 1) v_thread3Thread1of1ForFork3_k_10) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_9} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" [2025-04-26 16:53:40,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1531252128, now seen corresponding path program 1 times [2025-04-26 16:53:40,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:40,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328863803] [2025-04-26 16:53:40,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:40,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:40,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:40,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:40,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:53:40,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:40,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328863803] [2025-04-26 16:53:40,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328863803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:40,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:40,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:53:40,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986957787] [2025-04-26 16:53:40,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:40,288 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:40,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,289 INFO L85 PathProgramCache]: Analyzing trace with hash 141072, now seen corresponding path program 1 times [2025-04-26 16:53:40,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:40,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429330591] [2025-04-26 16:53:40,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:40,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:40,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:40,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:40,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,296 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:40,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:40,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:40,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:40,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:40,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:53:40,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:53:40,330 INFO L87 Difference]: Start difference. First operand 2250 states and 4486 transitions. cyclomatic complexity: 2360 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:40,386 INFO L93 Difference]: Finished difference Result 3895 states and 7683 transitions. [2025-04-26 16:53:40,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3895 states and 7683 transitions. [2025-04-26 16:53:40,432 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 165 [2025-04-26 16:53:40,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3895 states to 3895 states and 7683 transitions. [2025-04-26 16:53:40,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1165 [2025-04-26 16:53:40,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1165 [2025-04-26 16:53:40,458 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3895 states and 7683 transitions. [2025-04-26 16:53:40,458 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:40,458 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3895 states and 7683 transitions. [2025-04-26 16:53:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states and 7683 transitions. [2025-04-26 16:53:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 2418. [2025-04-26 16:53:40,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2418 states have (on average 1.9834574028122416) internal successors, (in total 4796), 2417 states have internal predecessors, (4796), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 4796 transitions. [2025-04-26 16:53:40,513 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2418 states and 4796 transitions. [2025-04-26 16:53:40,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:53:40,514 INFO L438 stractBuchiCegarLoop]: Abstraction has 2418 states and 4796 transitions. [2025-04-26 16:53:40,514 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:53:40,515 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2418 states and 4796 transitions. [2025-04-26 16:53:40,523 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 151 [2025-04-26 16:53:40,524 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:40,524 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:40,524 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:40,524 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:40,525 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[95] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[133] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_k]" "[110] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork3_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" [2025-04-26 16:53:40,525 INFO L754 eck$LassoCheckResult]: Loop: "[112] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork3_k_5 v_N_5) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[114] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork3_k_7 v_thread3Thread1of1ForFork3_k_7) v_B_3) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[115] L87-->L85-1: Formula: (= (+ v_thread3Thread1of1ForFork3_k_9 1) v_thread3Thread1of1ForFork3_k_10) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_9} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" [2025-04-26 16:53:40,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1531283841, now seen corresponding path program 1 times [2025-04-26 16:53:40,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:40,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212871231] [2025-04-26 16:53:40,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:40,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:40,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:40,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:40,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:40,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:40,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:40,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:40,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,549 INFO L85 PathProgramCache]: Analyzing trace with hash 141072, now seen corresponding path program 2 times [2025-04-26 16:53:40,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:40,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155923717] [2025-04-26 16:53:40,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:40,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:40,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:40,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:40,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:40,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:40,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:40,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:40,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:40,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1629367696, now seen corresponding path program 1 times [2025-04-26 16:53:40,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:40,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33248137] [2025-04-26 16:53:40,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:40,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:40,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:53:40,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:40,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,576 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:40,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:53:40,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:40,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:40,779 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:40,779 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:40,779 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:40,779 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:40,779 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:40,779 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:40,779 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:40,779 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:40,779 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-2modifiers.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:53:40,779 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:40,779 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:40,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:40,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:40,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:40,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:40,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:40,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:40,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:40,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:40,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:40,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:40,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:40,987 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:40,987 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:40,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:40,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:40,990 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:40,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:53:40,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:41,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:41,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:41,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:41,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:41,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:41,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:41,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:41,007 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:41,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:53:41,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:41,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:41,015 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:41,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:53:41,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:41,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:41,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:41,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:41,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:41,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:41,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:41,036 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:41,043 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:53:41,043 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:53:41,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:41,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:41,045 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:41,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:53:41,050 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:41,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:53:41,068 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:41,068 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:41,068 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork3_k, N) = -1*thread3Thread1of1ForFork3_k + 1*N Supporting invariants [] [2025-04-26 16:53:41,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:53:41,079 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:41,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:41,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:41,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:41,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:41,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:41,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:41,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:41,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:41,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:41,122 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:41,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:41,139 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:41,139 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2418 states and 4796 transitions. cyclomatic complexity: 2511 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:41,233 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2418 states and 4796 transitions. cyclomatic complexity: 2511. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 5157 states and 10063 transitions. Complement of second has 6 states. [2025-04-26 16:53:41,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-26 16:53:41,235 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 15 letters. Loop has 3 letters. [2025-04-26 16:53:41,235 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:41,235 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 16:53:41,235 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:41,235 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 15 letters. Loop has 6 letters. [2025-04-26 16:53:41,235 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:41,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5157 states and 10063 transitions. [2025-04-26 16:53:41,269 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 69 [2025-04-26 16:53:41,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5157 states to 3069 states and 5889 transitions. [2025-04-26 16:53:41,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 796 [2025-04-26 16:53:41,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 848 [2025-04-26 16:53:41,293 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3069 states and 5889 transitions. [2025-04-26 16:53:41,293 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:41,293 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3069 states and 5889 transitions. [2025-04-26 16:53:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states and 5889 transitions. [2025-04-26 16:53:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2990. [2025-04-26 16:53:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 2990 states have (on average 1.9344481605351171) internal successors, (in total 5784), 2989 states have internal predecessors, (5784), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 5784 transitions. [2025-04-26 16:53:41,353 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2990 states and 5784 transitions. [2025-04-26 16:53:41,353 INFO L438 stractBuchiCegarLoop]: Abstraction has 2990 states and 5784 transitions. [2025-04-26 16:53:41,353 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:53:41,353 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2990 states and 5784 transitions. [2025-04-26 16:53:41,365 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 69 [2025-04-26 16:53:41,365 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:41,365 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:41,366 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:41,366 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:41,367 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[95] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[133] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_k]" "[110] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork3_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" "[112] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork3_k_5 v_N_5) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[124] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[118] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[134] thread1EXIT-->L38: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_4 1) InVars {thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[]" [2025-04-26 16:53:41,367 INFO L754 eck$LassoCheckResult]: Loop: "[120] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_3) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[121] L87-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_10 (+ v_thread3Thread1of1ForFork0_k_9 1)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_9} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[118] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" [2025-04-26 16:53:41,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1840404521, now seen corresponding path program 1 times [2025-04-26 16:53:41,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:41,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6990809] [2025-04-26 16:53:41,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:41,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:41,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:53:41,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:53:41,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:41,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:41,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:53:41,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:53:41,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:41,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:41,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash 148980, now seen corresponding path program 1 times [2025-04-26 16:53:41,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:41,385 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866962182] [2025-04-26 16:53:41,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:41,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:41,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:41,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:41,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:41,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:41,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:41,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:41,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:41,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:41,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2061534814, now seen corresponding path program 1 times [2025-04-26 16:53:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:41,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616877593] [2025-04-26 16:53:41,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:41,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:41,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:53:41,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:41,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:41,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:41,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616877593] [2025-04-26 16:53:41,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616877593] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:53:41,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287054144] [2025-04-26 16:53:41,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:41,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:53:41,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:41,478 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:53:41,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-26 16:53:41,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:53:41,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:41,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:41,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:53:41,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:41,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:53:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:41,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287054144] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:53:41,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:53:41,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-04-26 16:53:41,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536535266] [2025-04-26 16:53:41,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:53:41,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:41,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-26 16:53:41,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-26 16:53:41,637 INFO L87 Difference]: Start difference. First operand 2990 states and 5784 transitions. cyclomatic complexity: 2952 Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (in total 34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:41,771 INFO L93 Difference]: Finished difference Result 3212 states and 6085 transitions. [2025-04-26 16:53:41,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3212 states and 6085 transitions. [2025-04-26 16:53:41,784 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 69 [2025-04-26 16:53:41,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3212 states to 3008 states and 5808 transitions. [2025-04-26 16:53:41,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 800 [2025-04-26 16:53:41,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 800 [2025-04-26 16:53:41,801 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3008 states and 5808 transitions. [2025-04-26 16:53:41,801 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:41,801 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3008 states and 5808 transitions. [2025-04-26 16:53:41,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states and 5808 transitions. [2025-04-26 16:53:41,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2996. [2025-04-26 16:53:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2996 states, 2996 states have (on average 1.9329105473965287) internal successors, (in total 5791), 2995 states have internal predecessors, (5791), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 5791 transitions. [2025-04-26 16:53:41,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2996 states and 5791 transitions. [2025-04-26 16:53:41,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:53:41,848 INFO L438 stractBuchiCegarLoop]: Abstraction has 2996 states and 5791 transitions. [2025-04-26 16:53:41,848 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:53:41,848 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2996 states and 5791 transitions. [2025-04-26 16:53:41,854 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 69 [2025-04-26 16:53:41,855 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:41,855 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:41,855 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:41,855 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:41,856 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[95] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[133] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_k]" "[110] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork3_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" "[112] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork3_k_5 v_N_5) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[124] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[118] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[134] thread1EXIT-->L38: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_4 1) InVars {thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[]" [2025-04-26 16:53:41,856 INFO L754 eck$LassoCheckResult]: Loop: "[120] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_3) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[121] L87-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_10 (+ v_thread3Thread1of1ForFork0_k_9 1)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_9} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[118] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" [2025-04-26 16:53:41,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:41,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1082496606, now seen corresponding path program 2 times [2025-04-26 16:53:41,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:41,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902304301] [2025-04-26 16:53:41,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:41,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:41,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-26 16:53:41,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:41,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:41,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:41,863 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:41,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:53:41,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:41,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:41,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:41,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:41,872 INFO L85 PathProgramCache]: Analyzing trace with hash 148980, now seen corresponding path program 2 times [2025-04-26 16:53:41,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:41,872 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543149054] [2025-04-26 16:53:41,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:41,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:41,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:41,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:41,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:41,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:41,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:41,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:41,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:41,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:41,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:41,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2042050167, now seen corresponding path program 2 times [2025-04-26 16:53:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:41,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672780479] [2025-04-26 16:53:41,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:41,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:41,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:53:41,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:53:41,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:41,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:41,896 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:41,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:53:41,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:53:41,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:41,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:42,240 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:42,240 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:42,240 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:42,240 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:42,240 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:42,240 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:42,240 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:42,240 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:42,240 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-2modifiers.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:53:42,240 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:42,240 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:42,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,586 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:42,586 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:42,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:42,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:42,590 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:42,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:53:42,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:42,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:42,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:42,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:42,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:42,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:42,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:42,610 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:42,619 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:53:42,620 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:53:42,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:42,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:42,622 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:42,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:53:42,624 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:42,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:42,642 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:42,642 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:42,642 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork0_k, N) = -1*thread3Thread1of1ForFork0_k + 1*N Supporting invariants [] [2025-04-26 16:53:42,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:53:42,650 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:53:42,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:42,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:53:42,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:42,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:42,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:42,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:42,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:42,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:42,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:42,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:42,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:42,696 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:42,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:42,706 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:42,706 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2996 states and 5791 transitions. cyclomatic complexity: 2953 Second operand has 4 states, 4 states have (on average 5.75) internal successors, (in total 23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:42,752 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2996 states and 5791 transitions. cyclomatic complexity: 2953. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (in total 23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3175 states and 6092 transitions. Complement of second has 6 states. [2025-04-26 16:53:42,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (in total 23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-04-26 16:53:42,754 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 23 letters. Loop has 3 letters. [2025-04-26 16:53:42,755 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:42,755 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 26 letters. Loop has 3 letters. [2025-04-26 16:53:42,755 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:42,755 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 23 letters. Loop has 6 letters. [2025-04-26 16:53:42,755 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:42,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3175 states and 6092 transitions. [2025-04-26 16:53:42,767 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 36 [2025-04-26 16:53:42,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3175 states to 1881 states and 3466 transitions. [2025-04-26 16:53:42,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 365 [2025-04-26 16:53:42,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 398 [2025-04-26 16:53:42,775 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1881 states and 3466 transitions. [2025-04-26 16:53:42,775 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:42,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1881 states and 3466 transitions. [2025-04-26 16:53:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states and 3466 transitions. [2025-04-26 16:53:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1761. [2025-04-26 16:53:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1761 states have (on average 1.9000567859170925) internal successors, (in total 3346), 1760 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 3346 transitions. [2025-04-26 16:53:42,821 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1761 states and 3346 transitions. [2025-04-26 16:53:42,821 INFO L438 stractBuchiCegarLoop]: Abstraction has 1761 states and 3346 transitions. [2025-04-26 16:53:42,821 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:53:42,821 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1761 states and 3346 transitions. [2025-04-26 16:53:42,824 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 36 [2025-04-26 16:53:42,824 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:42,824 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:42,825 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:42,825 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:42,825 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[133] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_k]" "[110] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork3_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[107] L68-2-->L71-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork2_j_13) 0) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[109] L71-1-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_16 (+ v_thread2Thread1of1ForFork2_j_15 1)) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_15} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[100] L67-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork2_j_3) InVars {N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} OutVars{N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} AuxVars[] AssignedVars[]" "[112] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork3_k_5 v_N_5) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[114] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork3_k_7 v_thread3Thread1of1ForFork3_k_7) v_B_3) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[124] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 16:53:42,825 INFO L754 eck$LassoCheckResult]: Loop: "[118] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[120] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_3) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[121] L87-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_10 (+ v_thread3Thread1of1ForFork0_k_9 1)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_9} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 16:53:42,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:42,826 INFO L85 PathProgramCache]: Analyzing trace with hash -103081289, now seen corresponding path program 1 times [2025-04-26 16:53:42,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:42,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682042578] [2025-04-26 16:53:42,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:42,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:42,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:53:42,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:53:42,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:42,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:42,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682042578] [2025-04-26 16:53:42,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682042578] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:53:42,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271144128] [2025-04-26 16:53:42,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:42,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:53:42,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:42,897 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:53:42,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-26 16:53:42,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:53:42,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:53:42,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:42,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:42,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:53:42,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:42,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:53:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:43,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271144128] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:53:43,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:53:43,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-04-26 16:53:43,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630592344] [2025-04-26 16:53:43,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:53:43,004 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:43,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:43,004 INFO L85 PathProgramCache]: Analyzing trace with hash 147030, now seen corresponding path program 3 times [2025-04-26 16:53:43,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:43,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597168387] [2025-04-26 16:53:43,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:53:43,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:43,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:43,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:43,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:53:43,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:43,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:43,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:43,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:43,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:43,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:43,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:43,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:43,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-26 16:53:43,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-26 16:53:43,027 INFO L87 Difference]: Start difference. First operand 1761 states and 3346 transitions. cyclomatic complexity: 1678 Second operand has 10 states, 10 states have (on average 4.5) internal successors, (in total 45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:43,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:43,171 INFO L93 Difference]: Finished difference Result 3886 states and 7394 transitions. [2025-04-26 16:53:43,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3886 states and 7394 transitions. [2025-04-26 16:53:43,186 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 36 [2025-04-26 16:53:43,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3886 states to 3608 states and 6878 transitions. [2025-04-26 16:53:43,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 568 [2025-04-26 16:53:43,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 568 [2025-04-26 16:53:43,215 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3608 states and 6878 transitions. [2025-04-26 16:53:43,215 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:43,215 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3608 states and 6878 transitions. [2025-04-26 16:53:43,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states and 6878 transitions. [2025-04-26 16:53:43,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 2594. [2025-04-26 16:53:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2594 states have (on average 1.9109483423284503) internal successors, (in total 4957), 2593 states have internal predecessors, (4957), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 4957 transitions. [2025-04-26 16:53:43,262 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2594 states and 4957 transitions. [2025-04-26 16:53:43,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 16:53:43,263 INFO L438 stractBuchiCegarLoop]: Abstraction has 2594 states and 4957 transitions. [2025-04-26 16:53:43,263 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:53:43,263 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2594 states and 4957 transitions. [2025-04-26 16:53:43,270 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 36 [2025-04-26 16:53:43,271 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:43,271 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:43,272 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:43,272 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:43,272 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[127] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_14, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[92] $Ultimate##0-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[130] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_20, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[98] $Ultimate##0-->L66: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[94] L53-1-->L54: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[99] L66-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[96] L54-->L55: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[97] L55-->L53-1: Formula: (= v_thread1Thread1of1ForFork1_i_10 (+ v_thread1Thread1of1ForFork1_i_9 1)) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_9} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[133] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_k]" "[110] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork3_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_k]" "[93] L53-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[107] L68-2-->L71-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork2_j_13) 0) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[109] L71-1-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_16 (+ v_thread2Thread1of1ForFork2_j_15 1)) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_15} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[101] L67-1-->L68: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[104] L68-->L68-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork2_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_9} AuxVars[] AssignedVars[]" "[107] L68-2-->L71-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork2_j_13) 0) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[109] L71-1-->L67-1: Formula: (= v_thread2Thread1of1ForFork2_j_16 (+ v_thread2Thread1of1ForFork2_j_15 1)) InVars {thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_15} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[100] L67-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork2_j_3) InVars {N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} OutVars{N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} AuxVars[] AssignedVars[]" "[112] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork3_k_5 v_N_5) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[114] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork3_k_7 v_thread3Thread1of1ForFork3_k_7) v_B_3) InVars {thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork3_k=v_thread3Thread1of1ForFork3_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[124] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 16:53:43,272 INFO L754 eck$LassoCheckResult]: Loop: "[118] L85-1-->L86: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[120] L86-->L87: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_3) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[121] L87-->L85-1: Formula: (= v_thread3Thread1of1ForFork0_k_10 (+ v_thread3Thread1of1ForFork0_k_9 1)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_9} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 16:53:43,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:43,273 INFO L85 PathProgramCache]: Analyzing trace with hash -713372654, now seen corresponding path program 2 times [2025-04-26 16:53:43,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:43,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94233674] [2025-04-26 16:53:43,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:43,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:43,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-26 16:53:43,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:53:43,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:43,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:43,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:43,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:53:43,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:53:43,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:43,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:43,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:43,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:43,325 INFO L85 PathProgramCache]: Analyzing trace with hash 147030, now seen corresponding path program 4 times [2025-04-26 16:53:43,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:43,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972758700] [2025-04-26 16:53:43,325 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:53:43,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:43,330 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-04-26 16:53:43,331 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:43,331 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:53:43,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:43,331 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:43,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:43,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:43,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:43,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:43,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:43,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash -586437467, now seen corresponding path program 1 times [2025-04-26 16:53:43,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:43,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771425502] [2025-04-26 16:53:43,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:43,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:43,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:53:43,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:53:43,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:43,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:43,348 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:43,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:53:43,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:53:43,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:43,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:43,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:43,761 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:43,761 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:43,761 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:43,761 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:43,761 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:43,761 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:43,761 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:43,761 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:43,761 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-2modifiers.bpl_petrified1_Iteration9_Lasso [2025-04-26 16:53:43,761 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:43,761 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:43,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:43,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,096 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:44,096 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:44,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,098 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:53:44,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,122 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:44,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,130 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:53:44,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,146 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:53:44,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,154 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:53:44,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,173 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:53:44,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,184 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:53:44,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,202 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:44,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,211 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:53:44,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,226 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:53:44,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,234 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:53:44,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,251 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:53:44,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,259 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:53:44,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,275 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:44,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,284 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:53:44,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,299 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:53:44,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,307 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:53:44,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,322 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:53:44,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,330 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:53:44,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,348 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:44,361 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:53:44,361 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:53:44,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,365 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:53:44,368 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:44,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:53:44,385 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:44,385 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:44,385 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork0_k, N) = -1*thread3Thread1of1ForFork0_k + 1*N Supporting invariants [] [2025-04-26 16:53:44,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:53:44,396 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:53:44,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:44,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:53:44,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:53:44,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:44,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:44,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:44,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:44,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:44,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:44,471 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:44,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:44,483 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:44,483 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2594 states and 4957 transitions. cyclomatic complexity: 2536 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:44,547 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2594 states and 4957 transitions. cyclomatic complexity: 2536. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 4401 states and 8363 transitions. Complement of second has 6 states. [2025-04-26 16:53:44,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:44,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-04-26 16:53:44,549 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 28 letters. Loop has 3 letters. [2025-04-26 16:53:44,549 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:44,549 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 31 letters. Loop has 3 letters. [2025-04-26 16:53:44,549 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:44,549 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 28 letters. Loop has 6 letters. [2025-04-26 16:53:44,553 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:44,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4401 states and 8363 transitions. [2025-04-26 16:53:44,573 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:53:44,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4401 states to 0 states and 0 transitions. [2025-04-26 16:53:44,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:53:44,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:53:44,573 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:53:44,573 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:53:44,574 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:53:44,574 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:53:44,574 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:53:44,574 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:53:44,574 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:53:44,574 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:53:44,574 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:53:44,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:53:44,585 INFO L201 PluginConnector]: Adding new model map-aggr-update1-2modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:53:44 BoogieIcfgContainer [2025-04-26 16:53:44,585 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:53:44,586 INFO L158 Benchmark]: Toolchain (without parser) took 7612.65ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 86.6MB in the beginning and 134.1MB in the end (delta: -47.5MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. [2025-04-26 16:53:44,586 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.22ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:44,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.23ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 84.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:44,587 INFO L158 Benchmark]: Boogie Preprocessor took 41.55ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.6MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:53:44,587 INFO L158 Benchmark]: RCFGBuilder took 227.49ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 73.9MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:53:44,587 INFO L158 Benchmark]: BuchiAutomizer took 7295.40ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 73.9MB in the beginning and 134.1MB in the end (delta: -60.1MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. [2025-04-26 16:53:44,588 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 1.22ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.23ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 84.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 41.55ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.6MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 227.49ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 73.9MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 7295.40ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 73.9MB in the beginning and 134.1MB in the end (delta: -60.1MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 4.4s. Construction of modules took 0.3s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 3017 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 795 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 790 mSDsluCounter, 815 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 466 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 638 IncrementalHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 349 mSDtfsCounter, 638 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital116 mio100 ax100 hnf100 lsp184 ukn29 mio100 lsp87 div100 bol100 ite100 ukn100 eq155 hnf95 smp91 dnf143 smp77 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 3 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 553, Number of transitions in reduction automaton: 2876, Number of states in reduction automaton: 1425, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (4 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 10 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:53:44,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:44,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-26 16:53:45,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...