/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/buchiAutomizer/concurrent-automaton-noLbe.epf --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/interleaved5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:50:41,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:50:41,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:50:41,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:50:41,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:50:41,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:50:41,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:50:41,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:50:41,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:50:41,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:50:41,233 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:50:41,233 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:50:41,233 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:50:41,233 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:50:41,233 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:50:41,233 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:50:41,233 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:50:41,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:50:41,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:50:41,234 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:50:41,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:50:41,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:50:41,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:50:41,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:50:41,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:50:41,234 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:50:41,234 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:50:41,234 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:50:41,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:50:41,235 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:50:41,235 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:50:41,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:50:41,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:50:41,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:50:41,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:50:41,239 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:50:41,239 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:50:41,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:50:41,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:50:41,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:50:41,469 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:50:41,469 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:50:41,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/interleaved5.c.bpl [2025-02-17 22:50:41,470 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/interleaved5.c.bpl' [2025-02-17 22:50:41,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:50:41,487 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:50:41,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:50:41,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:50:41,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:50:41,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:50:41" (1/1) ... [2025-02-17 22:50:41,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:50:41" (1/1) ... [2025-02-17 22:50:41,503 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:50:41,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:50:41,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:50:41,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:50:41,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:50:41,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:50:41" (1/1) ... [2025-02-17 22:50:41,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:50:41" (1/1) ... [2025-02-17 22:50:41,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:50:41" (1/1) ... [2025-02-17 22:50:41,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:50:41" (1/1) ... [2025-02-17 22:50:41,512 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:50:41" (1/1) ... [2025-02-17 22:50:41,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:50:41" (1/1) ... [2025-02-17 22:50:41,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:50:41" (1/1) ... [2025-02-17 22:50:41,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:50:41" (1/1) ... [2025-02-17 22:50:41,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:50:41" (1/1) ... [2025-02-17 22:50:41,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:50:41,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:50:41,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:50:41,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:50:41,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:50:41" (1/1) ... [2025-02-17 22:50:41,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:41,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:50:41,547 INFO L229 MonitoredProcess]: Starting monitored process 1 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-02-17 22:50:41,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-17 22:50:41,567 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:50:41,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:50:41,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:50:41,567 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:50:41,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:50:41,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:50:41,567 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:50:41,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:50:41,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:50:41,567 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:50:41,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:50:41,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:50:41,568 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-02-17 22:50:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-17 22:50:41,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-17 22:50:41,568 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-02-17 22:50:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-02-17 22:50:41,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-02-17 22:50:41,568 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:50:41,604 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:50:41,605 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:50:41,695 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:50:41,695 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:50:41,708 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:50:41,708 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:50:41,709 INFO L201 PluginConnector]: Adding new model interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:50:41 BoogieIcfgContainer [2025-02-17 22:50:41,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:50:41,710 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:50:41,710 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:50:41,716 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:50:41,717 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:50:41,717 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:50:41" (1/2) ... [2025-02-17 22:50:41,718 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54d20b83 and model type interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:50:41, skipping insertion in model container [2025-02-17 22:50:41,718 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:50:41,718 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:50:41" (2/2) ... [2025-02-17 22:50:41,719 INFO L363 chiAutomizerObserver]: Analyzing ICFG interleaved5.c.bpl [2025-02-17 22:50:41,781 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-02-17 22:50:41,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 139 flow [2025-02-17 22:50:41,831 INFO L124 PetriNetUnfolderBase]: 5/42 cut-off events. [2025-02-17 22:50:41,832 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-17 22:50:41,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 42 events. 5/42 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-02-17 22:50:41,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 52 transitions, 139 flow [2025-02-17 22:50:41,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 42 transitions, 114 flow [2025-02-17 22:50:41,848 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:50:44,452 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:50:44,453 INFO L101 AmpleReduction]: Number of pruned transitions: 18380, Number of non-trivial ample sets: 16920 [2025-02-17 22:50:44,453 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 14111 [2025-02-17 22:50:44,467 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:50:44,467 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:50:44,467 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:50:44,467 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:50:44,467 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:50:44,467 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:50:44,468 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:50:44,469 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:50:44,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10042 states, 10041 states have (on average 3.110048799920327) internal successors, (31228), 10041 states have internal predecessors, (31228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:50:44,715 INFO L131 ngComponentsAnalysis]: Automaton has 346 accepting balls. 7091 [2025-02-17 22:50:44,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:50:44,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:50:44,719 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:50:44,720 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:50:44,720 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:50:44,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10042 states, 10041 states have (on average 3.110048799920327) internal successors, (31228), 10041 states have internal predecessors, (31228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:50:44,905 INFO L131 ngComponentsAnalysis]: Automaton has 346 accepting balls. 7091 [2025-02-17 22:50:44,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:50:44,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:50:44,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:50:44,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:50:44,910 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L18: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[153] L18-->L37-1: Formula: (= v_thread1Thread1of1ForFork4_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork4_thidvar0]" [2025-02-17 22:50:44,910 INFO L754 eck$LassoCheckResult]: Loop: "[110] L37-1-->L35: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[112] L35-->L36: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[113] L36-->L37: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[114] L37-->L37-1: Formula: (and (< 0 v_f1_6) (= v_f1_5 0)) InVars {f1=v_f1_6} OutVars{f1=v_f1_5} AuxVars[] AssignedVars[f1]" [2025-02-17 22:50:44,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:50:44,914 INFO L85 PathProgramCache]: Analyzing trace with hash 4338, now seen corresponding path program 1 times [2025-02-17 22:50:44,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:50:44,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744219456] [2025-02-17 22:50:44,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:50:44,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:50:44,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:50:44,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:50:44,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:44,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:50:44,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:50:44,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:50:44,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:50:44,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:44,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:50:45,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:50:45,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:50:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash 4311780, now seen corresponding path program 1 times [2025-02-17 22:50:45,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:50:45,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710321373] [2025-02-17 22:50:45,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:50:45,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:50:45,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:50:45,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:50:45,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:45,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:50:45,053 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:50:45,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:50:45,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:50:45,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:45,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:50:45,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:50:45,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:50:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash -285344939, now seen corresponding path program 1 times [2025-02-17 22:50:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:50:45,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297791313] [2025-02-17 22:50:45,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:50:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:50:45,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:50:45,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:50:45,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:45,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:50:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:50:45,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:50:45,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297791313] [2025-02-17 22:50:45,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297791313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:50:45,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:50:45,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-17 22:50:45,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256626530] [2025-02-17 22:50:45,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:50:45,194 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:50:45,194 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:50:45,194 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:50:45,194 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:50:45,194 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:50:45,194 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:45,194 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:50:45,195 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:50:45,195 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:50:45,195 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:50:45,195 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:50:45,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:45,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:45,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:45,292 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:50:45,293 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:50:45,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:45,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:50:45,296 INFO L229 MonitoredProcess]: Starting monitored process 2 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-02-17 22:50:45,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:50:45,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:50:45,300 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:50:45,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:50:45,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:45,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:50:45,324 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-02-17 22:50:45,325 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-02-17 22:50:45,326 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:50:45,326 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:50:45,395 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:50:45,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-17 22:50:45,401 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:50:45,401 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:50:45,401 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:50:45,401 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:50:45,401 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:50:45,401 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:45,401 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:50:45,401 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:50:45,401 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:50:45,401 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:50:45,402 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:50:45,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:45,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:45,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:45,452 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:50:45,455 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:50:45,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:45,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:50:45,458 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-02-17 22:50:45,460 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-02-17 22:50:45,461 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-02-17 22:50:45,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:50:45,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:50:45,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:50:45,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:50:45,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:50:45,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:50:45,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:50:45,482 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:50:45,488 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:50:45,488 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:50:45,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:45,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:50:45,492 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-02-17 22:50:45,493 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-02-17 22:50:45,494 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:50:45,494 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:50:45,494 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:50:45,495 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-02-17 22:50:45,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-17 22:50:45,503 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:50:45,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:50:45,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:50:45,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:50:45,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:45,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:50:45,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:50:45,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:50:45,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:50:45,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:50:45,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:45,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:50:45,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:50:45,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:50:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:50:45,598 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:50:45,629 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10042 states, 10041 states have (on average 3.110048799920327) internal successors, (31228), 10041 states have internal predecessors, (31228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:50:46,060 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-02-17 22:50:46,112 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10042 states, 10041 states have (on average 3.110048799920327) internal successors, (31228), 10041 states have internal predecessors, (31228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24148 states and 80575 transitions. Complement of second has 6 states. [2025-02-17 22:50:46,117 INFO L141 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-02-17 22:50:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:50:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-02-17 22:50:46,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:50:46,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:50:46,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-17 22:50:46,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:50:46,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 2 letters. Loop has 8 letters. [2025-02-17 22:50:46,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:50:46,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24148 states and 80575 transitions. [2025-02-17 22:50:46,391 INFO L131 ngComponentsAnalysis]: Automaton has 365 accepting balls. 5869 [2025-02-17 22:50:46,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24148 states to 19000 states and 65936 transitions. [2025-02-17 22:50:46,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9148 [2025-02-17 22:50:46,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11771 [2025-02-17 22:50:46,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19000 states and 65936 transitions. [2025-02-17 22:50:46,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:50:46,768 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19000 states and 65936 transitions. [2025-02-17 22:50:46,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19000 states and 65936 transitions. [2025-02-17 22:50:47,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19000 to 16383. [2025-02-17 22:50:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16383 states, 16383 states have (on average 3.4526643471891596) internal successors, (56565), 16382 states have internal predecessors, (56565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:50:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16383 states to 16383 states and 56565 transitions. [2025-02-17 22:50:47,411 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16383 states and 56565 transitions. [2025-02-17 22:50:47,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:50:47,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:50:47,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:50:47,414 INFO L87 Difference]: Start difference. First operand 16383 states and 56565 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:50:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:50:47,705 INFO L93 Difference]: Finished difference Result 28177 states and 96370 transitions. [2025-02-17 22:50:47,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28177 states and 96370 transitions. [2025-02-17 22:50:48,184 INFO L131 ngComponentsAnalysis]: Automaton has 794 accepting balls. 10242 [2025-02-17 22:50:48,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28177 states to 26647 states and 91209 transitions. [2025-02-17 22:50:48,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15533 [2025-02-17 22:50:48,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16385 [2025-02-17 22:50:48,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26647 states and 91209 transitions. [2025-02-17 22:50:48,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:50:48,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26647 states and 91209 transitions. [2025-02-17 22:50:48,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26647 states and 91209 transitions. [2025-02-17 22:50:49,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26647 to 21454. [2025-02-17 22:50:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21454 states, 21454 states have (on average 3.5331872844224854) internal successors, (75801), 21453 states have internal predecessors, (75801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:50:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21454 states to 21454 states and 75801 transitions. [2025-02-17 22:50:49,305 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21454 states and 75801 transitions. [2025-02-17 22:50:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:50:49,311 INFO L432 stractBuchiCegarLoop]: Abstraction has 21454 states and 75801 transitions. [2025-02-17 22:50:49,311 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:50:49,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21454 states and 75801 transitions. [2025-02-17 22:50:49,568 INFO L131 ngComponentsAnalysis]: Automaton has 443 accepting balls. 7001 [2025-02-17 22:50:49,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:50:49,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:50:49,568 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:50:49,569 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:50:49,569 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L18: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[153] L18-->L37-1: Formula: (= v_thread1Thread1of1ForFork4_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork4_thidvar0]" "[141] L18-1-->L48: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[110] L37-1-->L35: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" [2025-02-17 22:50:49,569 INFO L754 eck$LassoCheckResult]: Loop: "[116] L48-->L50: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[118] L50-->L50-1: Formula: (and (< 0 v_f2_6) (= v_f2_5 0)) InVars {f2=v_f2_6} OutVars{f2=v_f2_5} AuxVars[] AssignedVars[f2]" "[119] L50-1-->L56: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[120] L56-->L48: Formula: (= v_f3_1 1) InVars {} OutVars{f3=v_f3_1} AuxVars[] AssignedVars[f3]" [2025-02-17 22:50:49,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:50:49,570 INFO L85 PathProgramCache]: Analyzing trace with hash 4173299, now seen corresponding path program 1 times [2025-02-17 22:50:49,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:50:49,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821331713] [2025-02-17 22:50:49,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:50:49,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:50:49,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:50:49,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:50:49,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:49,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:50:49,575 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:50:49,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:50:49,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:50:49,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:49,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:50:49,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:50:49,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:50:49,585 INFO L85 PathProgramCache]: Analyzing trace with hash 4496484, now seen corresponding path program 1 times [2025-02-17 22:50:49,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:50:49,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605817880] [2025-02-17 22:50:49,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:50:49,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:50:49,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:50:49,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:50:49,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:49,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:50:49,589 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:50:49,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:50:49,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:50:49,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:49,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:50:49,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:50:49,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:50:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1547174230, now seen corresponding path program 1 times [2025-02-17 22:50:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:50:49,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428026850] [2025-02-17 22:50:49,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:50:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:50:49,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:50:49,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:50:49,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:49,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:50:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:50:49,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:50:49,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428026850] [2025-02-17 22:50:49,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428026850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:50:49,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:50:49,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:50:49,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848075867] [2025-02-17 22:50:49,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:50:49,650 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:50:49,650 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:50:49,650 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:50:49,650 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:50:49,650 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:50:49,650 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:49,650 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:50:49,650 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:50:49,650 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:50:49,650 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:50:49,650 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:50:49,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:49,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:49,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:49,696 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:50:49,696 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:50:49,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:49,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:50:49,698 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-02-17 22:50:49,700 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-02-17 22:50:49,701 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:50:49,701 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:50:49,713 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:50:49,713 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f3=1} Honda state: {f3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:50:49,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-17 22:50:49,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:49,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:50:49,723 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-02-17 22:50:49,724 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-02-17 22:50:49,725 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:50:49,725 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:50:49,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-17 22:50:49,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:49,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:50:49,745 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-02-17 22:50:49,746 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-02-17 22:50:49,748 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:50:49,748 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:50:49,772 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:50:49,777 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-02-17 22:50:49,777 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:50:49,777 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:50:49,777 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:50:49,777 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:50:49,778 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:50:49,778 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:49,778 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:50:49,778 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:50:49,778 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:50:49,778 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:50:49,778 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:50:49,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:49,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:49,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:49,821 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:50:49,821 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:50:49,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:49,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:50:49,824 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-02-17 22:50:49,825 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-02-17 22:50:49,827 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-02-17 22:50:49,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:50:49,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:50:49,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:50:49,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:50:49,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:50:49,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:50:49,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:50:49,841 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:50:49,847 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-02-17 22:50:49,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:49,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:50:49,849 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-02-17 22:50:49,851 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-02-17 22:50:49,852 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-02-17 22:50:49,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:50:49,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:50:49,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:50:49,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:50:49,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:50:49,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:50:49,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:50:49,867 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:50:49,869 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:50:49,870 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:50:49,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:49,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:50:49,872 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-02-17 22:50:49,874 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-02-17 22:50:49,875 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:50:49,875 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:50:49,875 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:50:49,875 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f2) = 1*f2 Supporting invariants [] [2025-02-17 22:50:49,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-17 22:50:49,882 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:50:49,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:50:49,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:50:49,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:50:49,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:49,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:50:49,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:50:49,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:50:49,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:50:49,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:50:49,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:49,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:50:49,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:50:49,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:50:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:50:49,932 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-02-17 22:50:49,932 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21454 states and 75801 transitions. cyclomatic complexity: 54904 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:50:50,162 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-02-17 22:50:50,439 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21454 states and 75801 transitions. cyclomatic complexity: 54904. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40920 states and 149459 transitions. Complement of second has 5 states. [2025-02-17 22:50:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-17 22:50:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:50:50,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-02-17 22:50:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 90 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:50:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:50:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 90 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:50:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:50:50,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 90 transitions. Stem has 4 letters. Loop has 8 letters. [2025-02-17 22:50:50,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:50:50,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40920 states and 149459 transitions. [2025-02-17 22:50:51,014 INFO L131 ngComponentsAnalysis]: Automaton has 725 accepting balls. 10269 [2025-02-17 22:50:51,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40920 states to 38859 states and 144567 transitions. [2025-02-17 22:50:51,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17250 [2025-02-17 22:50:51,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18343 [2025-02-17 22:50:51,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38859 states and 144567 transitions. [2025-02-17 22:50:51,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:50:51,349 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38859 states and 144567 transitions. [2025-02-17 22:50:51,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38859 states and 144567 transitions. [2025-02-17 22:50:51,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38859 to 34074. [2025-02-17 22:50:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34074 states, 34074 states have (on average 3.8167811234372246) internal successors, (130053), 34073 states have internal predecessors, (130053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:50:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34074 states to 34074 states and 130053 transitions. [2025-02-17 22:50:52,326 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34074 states and 130053 transitions. [2025-02-17 22:50:52,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:50:52,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:50:52,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:50:52,326 INFO L87 Difference]: Start difference. First operand 34074 states and 130053 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:50:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:50:52,866 INFO L93 Difference]: Finished difference Result 45821 states and 161477 transitions. [2025-02-17 22:50:52,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45821 states and 161477 transitions. [2025-02-17 22:50:53,460 INFO L131 ngComponentsAnalysis]: Automaton has 1113 accepting balls. 11544 [2025-02-17 22:50:53,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45821 states to 41675 states and 148806 transitions. [2025-02-17 22:50:53,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20939 [2025-02-17 22:50:53,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20939 [2025-02-17 22:50:53,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41675 states and 148806 transitions. [2025-02-17 22:50:53,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:50:53,886 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41675 states and 148806 transitions. [2025-02-17 22:50:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41675 states and 148806 transitions. [2025-02-17 22:50:54,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41675 to 33151. [2025-02-17 22:50:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33151 states, 33151 states have (on average 3.6665560616572654) internal successors, (121550), 33150 states have internal predecessors, (121550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:50:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33151 states to 33151 states and 121550 transitions. [2025-02-17 22:50:54,872 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33151 states and 121550 transitions. [2025-02-17 22:50:54,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:50:54,875 INFO L432 stractBuchiCegarLoop]: Abstraction has 33151 states and 121550 transitions. [2025-02-17 22:50:54,875 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:50:54,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33151 states and 121550 transitions. [2025-02-17 22:50:55,084 INFO L131 ngComponentsAnalysis]: Automaton has 831 accepting balls. 9264 [2025-02-17 22:50:55,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:50:55,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:50:55,085 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-17 22:50:55,085 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:50:55,085 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L18: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[153] L18-->L37-1: Formula: (= v_thread1Thread1of1ForFork4_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork4_thidvar0]" "[141] L18-1-->L48: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[110] L37-1-->L35: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[144] L19-->L63: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[147] L20-->L78: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" [2025-02-17 22:50:55,085 INFO L754 eck$LassoCheckResult]: Loop: "[128] L78-->L80: Formula: (< v_x4_3 v_z_8) InVars {x4=v_x4_3, z=v_z_8} OutVars{x4=v_x4_3, z=v_z_8} AuxVars[] AssignedVars[]" "[130] L80-->L80-1: Formula: (and (< 0 v_f4_6) (= v_f4_5 0)) InVars {f4=v_f4_6} OutVars{f4=v_f4_5} AuxVars[] AssignedVars[f4]" "[131] L80-1-->L86: Formula: (= v_x4_4 (+ v_x4_5 1)) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" "[132] L86-->L78: Formula: (= v_f5_2 1) InVars {} OutVars{f5=v_f5_2} AuxVars[] AssignedVars[f5]" [2025-02-17 22:50:55,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:50:55,086 INFO L85 PathProgramCache]: Analyzing trace with hash -284422346, now seen corresponding path program 1 times [2025-02-17 22:50:55,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:50:55,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443954900] [2025-02-17 22:50:55,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:50:55,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:50:55,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:50:55,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:50:55,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:55,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:50:55,094 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:50:55,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:50:55,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:50:55,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:55,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:50:55,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:50:55,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:50:55,102 INFO L85 PathProgramCache]: Analyzing trace with hash 4865892, now seen corresponding path program 1 times [2025-02-17 22:50:55,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:50:55,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759672251] [2025-02-17 22:50:55,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:50:55,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:50:55,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:50:55,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:50:55,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:55,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:50:55,106 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:50:55,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:50:55,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:50:55,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:55,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:50:55,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:50:55,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:50:55,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1604430873, now seen corresponding path program 1 times [2025-02-17 22:50:55,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:50:55,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523446792] [2025-02-17 22:50:55,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:50:55,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:50:55,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:50:55,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:50:55,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:55,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:50:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:50:55,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:50:55,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523446792] [2025-02-17 22:50:55,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523446792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:50:55,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:50:55,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:50:55,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223951649] [2025-02-17 22:50:55,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:50:55,172 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:50:55,172 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:50:55,172 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:50:55,172 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:50:55,172 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:50:55,172 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:55,172 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:50:55,172 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:50:55,173 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:50:55,173 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:50:55,173 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:50:55,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:55,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:55,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:55,208 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:50:55,208 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:50:55,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:55,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:50:55,210 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-02-17 22:50:55,211 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-02-17 22:50:55,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:50:55,213 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:50:55,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:50:55,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:55,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:50:55,231 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-02-17 22:50:55,232 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-02-17 22:50:55,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:50:55,234 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:50:55,258 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:50:55,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-17 22:50:55,262 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:50:55,262 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:50:55,262 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:50:55,262 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:50:55,262 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:50:55,262 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:55,262 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:50:55,262 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:50:55,262 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:50:55,262 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:50:55,262 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:50:55,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:55,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:55,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:50:55,296 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:50:55,297 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:50:55,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:55,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:50:55,299 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-02-17 22:50:55,300 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-02-17 22:50:55,301 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-02-17 22:50:55,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:50:55,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:50:55,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:50:55,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:50:55,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:50:55,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:50:55,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:50:55,314 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:50:55,317 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:50:55,317 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:50:55,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:50:55,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:50:55,319 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-02-17 22:50:55,321 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-02-17 22:50:55,322 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:50:55,322 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:50:55,322 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:50:55,322 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f4) = 1*f4 Supporting invariants [] [2025-02-17 22:50:55,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-17 22:50:55,328 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:50:55,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:50:55,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:50:55,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:50:55,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:55,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:50:55,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:50:55,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:50:55,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:50:55,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:50:55,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:50:55,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:50:55,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:50:55,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:50:55,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-17 22:50:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:50:55,497 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-02-17 22:50:55,498 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33151 states and 121550 transitions. cyclomatic complexity: 89445 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:50:56,485 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33151 states and 121550 transitions. cyclomatic complexity: 89445. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 109694 states and 414158 transitions. Complement of second has 5 states. [2025-02-17 22:50:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-17 22:50:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:50:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-17 22:50:56,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 84 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-17 22:50:56,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:50:56,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 84 transitions. Stem has 10 letters. Loop has 4 letters. [2025-02-17 22:50:56,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:50:56,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 84 transitions. Stem has 6 letters. Loop has 8 letters. [2025-02-17 22:50:56,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:50:56,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109694 states and 414158 transitions. [2025-02-17 22:50:58,203 INFO L131 ngComponentsAnalysis]: Automaton has 1854 accepting balls. 13356 [2025-02-17 22:50:59,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109694 states to 94723 states and 367299 transitions. [2025-02-17 22:50:59,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35335 [2025-02-17 22:50:59,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39646 [2025-02-17 22:50:59,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94723 states and 367299 transitions. [2025-02-17 22:50:59,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:50:59,380 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94723 states and 367299 transitions. [2025-02-17 22:50:59,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94723 states and 367299 transitions. [2025-02-17 22:51:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94723 to 82266. [2025-02-17 22:51:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82266 states, 82266 states have (on average 4.00239467094547) internal successors, (329261), 82265 states have internal predecessors, (329261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82266 states to 82266 states and 329261 transitions. [2025-02-17 22:51:01,808 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82266 states and 329261 transitions. [2025-02-17 22:51:01,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:51:01,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:51:01,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:51:01,809 INFO L87 Difference]: Start difference. First operand 82266 states and 329261 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:51:03,152 INFO L93 Difference]: Finished difference Result 134777 states and 518116 transitions. [2025-02-17 22:51:03,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134777 states and 518116 transitions. [2025-02-17 22:51:05,369 INFO L131 ngComponentsAnalysis]: Automaton has 2178 accepting balls. 18254 [2025-02-17 22:51:06,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134777 states to 105582 states and 399075 transitions. [2025-02-17 22:51:06,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46839 [2025-02-17 22:51:06,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49889 [2025-02-17 22:51:06,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105582 states and 399075 transitions. [2025-02-17 22:51:06,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:51:06,810 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105582 states and 399075 transitions. [2025-02-17 22:51:06,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105582 states and 399075 transitions. [2025-02-17 22:51:08,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105582 to 62694. [2025-02-17 22:51:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62694 states, 62694 states have (on average 3.8425048648993525) internal successors, (240902), 62693 states have internal predecessors, (240902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62694 states to 62694 states and 240902 transitions. [2025-02-17 22:51:08,806 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62694 states and 240902 transitions. [2025-02-17 22:51:08,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:51:08,807 INFO L432 stractBuchiCegarLoop]: Abstraction has 62694 states and 240902 transitions. [2025-02-17 22:51:08,807 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:51:08,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62694 states and 240902 transitions. [2025-02-17 22:51:09,175 INFO L131 ngComponentsAnalysis]: Automaton has 780 accepting balls. 12658 [2025-02-17 22:51:09,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:51:09,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:51:09,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-17 22:51:09,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:51:09,176 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L18: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[153] L18-->L37-1: Formula: (= v_thread1Thread1of1ForFork4_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork4_thidvar0]" "[141] L18-1-->L48: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[110] L37-1-->L35: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[144] L19-->L63: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[147] L20-->L78: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" [2025-02-17 22:51:09,176 INFO L754 eck$LassoCheckResult]: Loop: "[122] L63-->L65: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[124] L65-->L65-1: Formula: (and (< 0 v_f3_6) (= v_f3_5 0)) InVars {f3=v_f3_6} OutVars{f3=v_f3_5} AuxVars[] AssignedVars[f3]" "[125] L65-1-->L71: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[126] L71-->L63: Formula: (= v_f4_1 1) InVars {} OutVars{f4=v_f4_1} AuxVars[] AssignedVars[f4]" "[128] L78-->L80: Formula: (< v_x4_3 v_z_8) InVars {x4=v_x4_3, z=v_z_8} OutVars{x4=v_x4_3, z=v_z_8} AuxVars[] AssignedVars[]" "[130] L80-->L80-1: Formula: (and (< 0 v_f4_6) (= v_f4_5 0)) InVars {f4=v_f4_6} OutVars{f4=v_f4_5} AuxVars[] AssignedVars[f4]" "[131] L80-1-->L86: Formula: (= v_x4_4 (+ v_x4_5 1)) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" "[132] L86-->L78: Formula: (= v_f5_2 1) InVars {} OutVars{f5=v_f5_2} AuxVars[] AssignedVars[f5]" [2025-02-17 22:51:09,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:09,177 INFO L85 PathProgramCache]: Analyzing trace with hash -284422346, now seen corresponding path program 2 times [2025-02-17 22:51:09,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:09,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41562061] [2025-02-17 22:51:09,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:51:09,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:09,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:51:09,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:51:09,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:51:09,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:09,184 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:09,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:51:09,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:51:09,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:09,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:09,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:09,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1852701753, now seen corresponding path program 1 times [2025-02-17 22:51:09,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:09,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388766611] [2025-02-17 22:51:09,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:09,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:09,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:51:09,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:51:09,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:09,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:09,194 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:09,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:51:09,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:51:09,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:09,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:09,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:09,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:09,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1766460924, now seen corresponding path program 1 times [2025-02-17 22:51:09,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:09,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360002937] [2025-02-17 22:51:09,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:09,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:09,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:51:09,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:51:09,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:09,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:51:09,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:51:09,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360002937] [2025-02-17 22:51:09,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360002937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:51:09,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:51:09,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:51:09,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852878581] [2025-02-17 22:51:09,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:51:09,335 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:09,335 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:09,335 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:09,335 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:09,335 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:51:09,335 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:09,335 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:09,335 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:09,335 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:51:09,335 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:09,335 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:09,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:09,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:09,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:09,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:09,438 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:09,439 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:51:09,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:09,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:09,441 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-02-17 22:51:09,442 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-02-17 22:51:09,445 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:51:09,445 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:09,465 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-02-17 22:51:09,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:09,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:09,468 INFO L229 MonitoredProcess]: Starting monitored process 17 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-02-17 22:51:09,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-17 22:51:09,471 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:51:09,471 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:09,562 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:51:09,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-17 22:51:09,567 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:09,567 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:09,567 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:09,567 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:09,567 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:51:09,567 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:09,567 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:09,567 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:09,567 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:51:09,567 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:09,567 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:09,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:09,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:09,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:09,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:09,623 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:09,623 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:51:09,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:09,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:09,625 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-02-17 22:51:09,626 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-02-17 22:51:09,627 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-02-17 22:51:09,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:51:09,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:51:09,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:51:09,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:51:09,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:51:09,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:51:09,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:51:09,641 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:51:09,644 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:51:09,644 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:51:09,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:09,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:09,646 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-02-17 22:51:09,648 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-02-17 22:51:09,649 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:51:09,649 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:51:09,649 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:51:09,649 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-02-17 22:51:09,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:09,655 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:51:09,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:09,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:51:09,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:51:09,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:09,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:09,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:51:09,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:09,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:51:09,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:51:09,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:09,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:09,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:51:09,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:51:09,730 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:51:09,730 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62694 states and 240902 transitions. cyclomatic complexity: 179499 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:10,080 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-02-17 22:51:11,752 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62694 states and 240902 transitions. cyclomatic complexity: 179499. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 182976 states and 729112 transitions. Complement of second has 6 states. [2025-02-17 22:51:11,753 INFO L141 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-02-17 22:51:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-02-17 22:51:11,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 6 letters. Loop has 8 letters. [2025-02-17 22:51:11,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:11,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 14 letters. Loop has 8 letters. [2025-02-17 22:51:11,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:11,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 6 letters. Loop has 16 letters. [2025-02-17 22:51:11,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:11,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182976 states and 729112 transitions. [2025-02-17 22:51:14,425 INFO L131 ngComponentsAnalysis]: Automaton has 2244 accepting balls. 8976 [2025-02-17 22:51:16,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182976 states to 132408 states and 579046 transitions. [2025-02-17 22:51:16,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34249 [2025-02-17 22:51:16,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39202 [2025-02-17 22:51:16,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132408 states and 579046 transitions. [2025-02-17 22:51:16,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:51:16,437 INFO L218 hiAutomatonCegarLoop]: Abstraction has 132408 states and 579046 transitions. [2025-02-17 22:51:16,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132408 states and 579046 transitions. [2025-02-17 22:51:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132408 to 126635. [2025-02-17 22:51:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126635 states, 126635 states have (on average 4.395538358273779) internal successors, (556629), 126634 states have internal predecessors, (556629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126635 states to 126635 states and 556629 transitions. [2025-02-17 22:51:20,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126635 states and 556629 transitions. [2025-02-17 22:51:20,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:51:20,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:51:20,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:51:20,244 INFO L87 Difference]: Start difference. First operand 126635 states and 556629 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:51:23,103 INFO L93 Difference]: Finished difference Result 237481 states and 1026074 transitions. [2025-02-17 22:51:23,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 237481 states and 1026074 transitions. [2025-02-17 22:51:26,921 INFO L131 ngComponentsAnalysis]: Automaton has 4405 accepting balls. 17620 [2025-02-17 22:51:29,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 237481 states to 224310 states and 974190 transitions. [2025-02-17 22:51:29,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62469 [2025-02-17 22:51:29,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64198 [2025-02-17 22:51:29,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224310 states and 974190 transitions. [2025-02-17 22:51:29,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:51:29,973 INFO L218 hiAutomatonCegarLoop]: Abstraction has 224310 states and 974190 transitions. [2025-02-17 22:51:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224310 states and 974190 transitions. [2025-02-17 22:51:35,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224310 to 199863. [2025-02-17 22:51:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199863 states, 199863 states have (on average 4.513746916637897) internal successors, (902131), 199862 states have internal predecessors, (902131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:37,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199863 states to 199863 states and 902131 transitions. [2025-02-17 22:51:37,206 INFO L240 hiAutomatonCegarLoop]: Abstraction has 199863 states and 902131 transitions. [2025-02-17 22:51:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:51:37,208 INFO L432 stractBuchiCegarLoop]: Abstraction has 199863 states and 902131 transitions. [2025-02-17 22:51:37,208 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:51:37,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199863 states and 902131 transitions. [2025-02-17 22:51:39,671 INFO L131 ngComponentsAnalysis]: Automaton has 3698 accepting balls. 14792 [2025-02-17 22:51:39,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:51:39,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:51:39,674 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:51:39,674 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:51:39,675 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L18: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[153] L18-->L37-1: Formula: (= v_thread1Thread1of1ForFork4_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork4_thidvar0]" "[141] L18-1-->L48: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[110] L37-1-->L35: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[144] L19-->L63: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[147] L20-->L78: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" "[150] L21-->L93: Formula: (and (= v_thread5Thread1of1ForFork3_thidvar1_2 5) (= v_thread5Thread1of1ForFork3_thidvar3_2 5) (= v_thread5Thread1of1ForFork3_thidvar4_2 5) (= v_thread5Thread1of1ForFork3_thidvar2_2 5) (= v_thread5Thread1of1ForFork3_thidvar0_2 5)) InVars {} OutVars{thread5Thread1of1ForFork3_thidvar2=v_thread5Thread1of1ForFork3_thidvar2_2, thread5Thread1of1ForFork3_thidvar1=v_thread5Thread1of1ForFork3_thidvar1_2, thread5Thread1of1ForFork3_thidvar4=v_thread5Thread1of1ForFork3_thidvar4_2, thread5Thread1of1ForFork3_thidvar3=v_thread5Thread1of1ForFork3_thidvar3_2, thread5Thread1of1ForFork3_thidvar0=v_thread5Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork3_thidvar2, thread5Thread1of1ForFork3_thidvar1, thread5Thread1of1ForFork3_thidvar4, thread5Thread1of1ForFork3_thidvar3, thread5Thread1of1ForFork3_thidvar0]" [2025-02-17 22:51:39,676 INFO L754 eck$LassoCheckResult]: Loop: "[134] L93-->L95: Formula: (< v_x5_2 v_z_9) InVars {x5=v_x5_2, z=v_z_9} OutVars{x5=v_x5_2, z=v_z_9} AuxVars[] AssignedVars[]" "[136] L95-->L95-1: Formula: (and (= v_f5_5 0) (< 0 v_f5_6)) InVars {f5=v_f5_6} OutVars{f5=v_f5_5} AuxVars[] AssignedVars[f5]" "[137] L95-1-->L101: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" "[138] L101-->L93: Formula: (= v_f1_4 1) InVars {} OutVars{f1=v_f1_4} AuxVars[] AssignedVars[f1]" [2025-02-17 22:51:39,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:39,677 INFO L85 PathProgramCache]: Analyzing trace with hash -227157984, now seen corresponding path program 1 times [2025-02-17 22:51:39,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:39,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754820796] [2025-02-17 22:51:39,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:39,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:39,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:51:39,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:51:39,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:39,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:39,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:39,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:51:39,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:51:39,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:39,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:39,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:39,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:39,703 INFO L85 PathProgramCache]: Analyzing trace with hash 5050596, now seen corresponding path program 1 times [2025-02-17 22:51:39,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:39,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462292004] [2025-02-17 22:51:39,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:39,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:39,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:51:39,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:51:39,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:39,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:39,710 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:39,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:51:39,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:51:39,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:39,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:39,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:39,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:39,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1781808765, now seen corresponding path program 1 times [2025-02-17 22:51:39,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:39,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555567428] [2025-02-17 22:51:39,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:39,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:39,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:51:39,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:51:39,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:39,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:51:39,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:51:39,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555567428] [2025-02-17 22:51:39,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555567428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:51:39,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:51:39,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:51:39,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707338431] [2025-02-17 22:51:39,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:51:39,815 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:39,815 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:39,815 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:39,816 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:39,816 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:51:39,816 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:39,816 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:39,816 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:39,816 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:51:39,816 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:39,816 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:39,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:39,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:39,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:39,880 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:39,880 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:51:39,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:39,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:39,884 INFO L229 MonitoredProcess]: Starting monitored process 20 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-02-17 22:51:39,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-17 22:51:39,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:51:39,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:39,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:39,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:39,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:39,927 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-02-17 22:51:39,929 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-02-17 22:51:39,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:51:39,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:39,975 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:51:39,981 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-02-17 22:51:39,981 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:39,981 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:39,981 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:39,981 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:39,981 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:51:39,981 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:39,983 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:39,983 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:39,983 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved5.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:51:39,983 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:39,983 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:39,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:40,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:40,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:40,035 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:40,035 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:51:40,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:40,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:40,039 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-02-17 22:51:40,040 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-02-17 22:51:40,041 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-02-17 22:51:40,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:51:40,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:51:40,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:51:40,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:51:40,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:51:40,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:51:40,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:51:40,055 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:51:40,059 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:51:40,059 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:51:40,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:40,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:40,064 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-02-17 22:51:40,068 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:51:40,069 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:51:40,069 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:51:40,069 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f5) = 1*f5 Supporting invariants [] [2025-02-17 22:51:40,069 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-02-17 22:51:40,084 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-02-17 22:51:40,084 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:51:40,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:40,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:51:40,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:51:40,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:40,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:40,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:51:40,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:40,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:51:40,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:51:40,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:40,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:40,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:51:40,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:51:40,168 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-02-17 22:51:40,169 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 199863 states and 902131 transitions. cyclomatic complexity: 712216 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)