/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:38:50,973 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:38:51,047 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:38:51,086 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:38:51,087 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:38:51,087 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:38:51,088 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:38:51,089 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:38:51,089 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:38:51,094 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:38:51,094 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:38:51,095 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:38:51,095 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:38:51,096 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:38:51,097 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:38:51,097 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:38:51,097 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:38:51,098 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:38:51,098 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:38:51,098 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:38:51,098 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:38:51,099 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:38:51,099 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:38:51,100 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:38:51,101 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:38:51,101 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:38:51,101 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:38:51,101 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:38:51,101 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:38:51,102 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:38:51,103 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:38:51,103 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:38:51,103 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:38:51,104 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:38:51,104 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:38:51,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:38:51,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:38:51,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:38:51,337 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:38:51,339 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:38:51,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring.wvr.bpl [2023-10-12 17:38:51,340 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring.wvr.bpl' [2023-10-12 17:38:51,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:38:51,377 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:38:51,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:51,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:38:51,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:38:51,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:51" (1/1) ... [2023-10-12 17:38:51,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:51" (1/1) ... [2023-10-12 17:38:51,405 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:38:51,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:51,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:38:51,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:38:51,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:38:51,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:51" (1/1) ... [2023-10-12 17:38:51,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:51" (1/1) ... [2023-10-12 17:38:51,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:51" (1/1) ... [2023-10-12 17:38:51,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:51" (1/1) ... [2023-10-12 17:38:51,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:51" (1/1) ... [2023-10-12 17:38:51,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:51" (1/1) ... [2023-10-12 17:38:51,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:51" (1/1) ... [2023-10-12 17:38:51,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:51" (1/1) ... [2023-10-12 17:38:51,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:38:51,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:38:51,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:38:51,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:38:51,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:51" (1/1) ... [2023-10-12 17:38:51,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:51,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:51,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:51,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:38:51,523 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:38:51,524 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:38:51,524 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:38:51,524 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:38:51,524 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:38:51,524 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:38:51,524 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:38:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:38:51,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:38:51,525 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:38:51,525 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:38:51,525 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:38:51,526 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:38:51,582 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:38:51,585 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:38:51,700 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:38:51,725 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:38:51,726 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:38:51,728 INFO L201 PluginConnector]: Adding new model ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:51 BoogieIcfgContainer [2023-10-12 17:38:51,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:38:51,729 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:38:51,729 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:38:51,733 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:38:51,734 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:51,734 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:51" (1/2) ... [2023-10-12 17:38:51,736 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f6d18ea and model type ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:38:51, skipping insertion in model container [2023-10-12 17:38:51,736 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:51,737 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:51" (2/2) ... [2023-10-12 17:38:51,738 INFO L332 chiAutomizerObserver]: Analyzing ICFG ring.wvr.bpl [2023-10-12 17:38:51,821 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:38:51,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 114 flow [2023-10-12 17:38:51,870 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2023-10-12 17:38:51,871 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:51,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:38:51,875 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 45 transitions, 114 flow [2023-10-12 17:38:51,879 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 96 flow [2023-10-12 17:38:51,881 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:38:51,893 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 96 flow [2023-10-12 17:38:51,895 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 96 flow [2023-10-12 17:38:51,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 96 flow [2023-10-12 17:38:51,905 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2023-10-12 17:38:51,905 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:51,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:38:51,907 INFO L119 LiptonReduction]: Number of co-enabled transitions 634 [2023-10-12 17:38:52,609 INFO L134 LiptonReduction]: Checked pairs total: 565 [2023-10-12 17:38:52,609 INFO L136 LiptonReduction]: Total number of compositions: 21 [2023-10-12 17:38:52,625 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:38:52,625 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:38:52,626 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:38:52,626 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:38:52,626 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:38:52,626 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:38:52,626 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:38:52,626 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:38:52,627 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 19 transitions, 56 flow [2023-10-12 17:38:52,635 ERROR L47 etriNetUnfolderRabin]: [1:1A:[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][6], 2:2A:[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][2], 3:3A:[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][4], 6:4A:[163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][12]][7:5A:[169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][17]] [2023-10-12 17:38:52,637 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:52,638 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-10-12 17:38:52,639 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:52,640 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:52,643 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:38:52,643 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 19 transitions, 56 flow [2023-10-12 17:38:52,645 ERROR L47 etriNetUnfolderRabin]: [1:1A:[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][6], 2:2A:[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][2], 3:3A:[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][4], 6:4A:[163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][12]][7:5A:[169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][17]] [2023-10-12 17:38:52,646 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:52,646 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-10-12 17:38:52,646 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:52,646 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:52,649 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 59#[L98, $Ultimate##0, $Ultimate##0]true [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 61#[L98, L58-1, $Ultimate##0]true [2023-10-12 17:38:52,650 INFO L750 eck$LassoCheckResult]: Loop: 61#[L98, L58-1, $Ultimate##0]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 61#[L98, L58-1, $Ultimate##0]true [2023-10-12 17:38:52,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:52,654 INFO L85 PathProgramCache]: Analyzing trace with hash 4190712, now seen corresponding path program 1 times [2023-10-12 17:38:52,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:52,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703092169] [2023-10-12 17:38:52,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:52,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:52,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:52,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:52,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:52,749 INFO L85 PathProgramCache]: Analyzing trace with hash 200, now seen corresponding path program 1 times [2023-10-12 17:38:52,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:52,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723046032] [2023-10-12 17:38:52,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:52,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:52,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:52,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:52,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:52,798 INFO L85 PathProgramCache]: Analyzing trace with hash 129912241, now seen corresponding path program 1 times [2023-10-12 17:38:52,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:52,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233894631] [2023-10-12 17:38:52,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:52,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:38:52,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:52,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233894631] [2023-10-12 17:38:52,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233894631] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:52,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:38:52,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:38:52,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480404393] [2023-10-12 17:38:52,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:53,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:53,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:38:53,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:38:53,031 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 26 places, 19 transitions, 56 flow. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:53,031 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:53,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:53,117 INFO L124 PetriNetUnfolderBase]: 152/232 cut-off events. [2023-10-12 17:38:53,117 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:38:53,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 232 events. 152/232 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 658 event pairs, 24 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 430. Up to 176 conditions per place. [2023-10-12 17:38:53,123 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2023-10-12 17:38:53,123 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 27 places, 27 transitions, 132 flow [2023-10-12 17:38:53,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:38:53,135 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 27 transitions, 132 flow [2023-10-12 17:38:53,135 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:38:53,135 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 27 transitions, 132 flow [2023-10-12 17:38:53,144 ERROR L47 etriNetUnfolderRabin]: [1:1A:[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r][2], 7:4A:[161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back][4]][25:5A:[166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r][8], 26:6A:[161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back][14]] [2023-10-12 17:38:53,144 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:53,144 INFO L124 PetriNetUnfolderBase]: 11/25 cut-off events. [2023-10-12 17:38:53,144 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-10-12 17:38:53,144 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:53,145 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 83#[L97-1, L34-1]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 85#[L35-1, L97-1]true [2023-10-12 17:38:53,145 INFO L750 eck$LassoCheckResult]: Loop: 85#[L35-1, L97-1]true [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 83#[L97-1, L34-1]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 85#[L35-1, L97-1]true [2023-10-12 17:38:53,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:53,146 INFO L85 PathProgramCache]: Analyzing trace with hash 4190958, now seen corresponding path program 1 times [2023-10-12 17:38:53,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:53,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464545647] [2023-10-12 17:38:53,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:53,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:53,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:53,165 INFO L85 PathProgramCache]: Analyzing trace with hash 6268, now seen corresponding path program 1 times [2023-10-12 17:38:53,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:53,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870978760] [2023-10-12 17:38:53,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:53,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:53,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:53,176 INFO L85 PathProgramCache]: Analyzing trace with hash -267451351, now seen corresponding path program 1 times [2023-10-12 17:38:53,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:53,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293968627] [2023-10-12 17:38:53,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:53,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:38:53,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:53,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293968627] [2023-10-12 17:38:53,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293968627] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:53,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:38:53,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:38:53,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432529749] [2023-10-12 17:38:53,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:53,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:53,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:38:53,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:38:53,278 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 27 places, 27 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 2.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) [2023-10-12 17:38:53,278 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:53,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:53,357 INFO L124 PetriNetUnfolderBase]: 177/284 cut-off events. [2023-10-12 17:38:53,357 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-10-12 17:38:53,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 284 events. 177/284 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 883 event pairs, 27 based on Foata normal form. 13/218 useless extension candidates. Maximal degree in co-relation 701. Up to 202 conditions per place. [2023-10-12 17:38:53,364 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 40 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2023-10-12 17:38:53,364 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 29 places, 43 transitions, 291 flow [2023-10-12 17:38:53,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:38:53,366 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 43 transitions, 291 flow [2023-10-12 17:38:53,366 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:38:53,366 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 43 transitions, 291 flow [2023-10-12 17:38:53,371 ERROR L47 etriNetUnfolderRabin]: [1:1A:[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r][2], 6:4A:[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][3], 21:5A:[163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][7], 34:6A:[161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back][4]][36:7A:[169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][16]] [2023-10-12 17:38:53,371 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:53,371 INFO L124 PetriNetUnfolderBase]: 17/35 cut-off events. [2023-10-12 17:38:53,371 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:38:53,371 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:53,372 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 83#[L97-1, L34-1]true [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 102#[L34-1, L98, $Ultimate##0]true [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 104#[L34-1, L98, L58-1]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 106#[L35-1, L98, L58-1]true [2023-10-12 17:38:53,373 INFO L750 eck$LassoCheckResult]: Loop: 106#[L35-1, L98, L58-1]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 106#[L35-1, L98, L58-1]true [2023-10-12 17:38:53,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:53,377 INFO L85 PathProgramCache]: Analyzing trace with hash -267468742, now seen corresponding path program 1 times [2023-10-12 17:38:53,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:53,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618415976] [2023-10-12 17:38:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:53,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:53,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:53,416 INFO L85 PathProgramCache]: Analyzing trace with hash 200, now seen corresponding path program 2 times [2023-10-12 17:38:53,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:53,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800743949] [2023-10-12 17:38:53,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:53,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:53,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:53,427 INFO L85 PathProgramCache]: Analyzing trace with hash 298403759, now seen corresponding path program 1 times [2023-10-12 17:38:53,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:53,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575942375] [2023-10-12 17:38:53,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:53,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:53,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:53,697 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:53,698 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:53,698 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:53,698 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:53,698 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:53,698 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:53,698 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:53,699 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:53,699 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:38:53,699 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:53,699 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:53,716 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:53,732 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:53,735 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:53,737 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:53,740 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:53,743 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:53,811 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:53,815 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:54,026 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:54,029 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:54,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:54,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:54,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:54,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:38:54,042 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 [2023-10-12 17:38:54,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:54,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:54,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:54,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:54,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:54,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:54,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:54,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:54,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:54,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:54,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:54,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:38:54,085 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 [2023-10-12 17:38:54,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:54,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:54,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:54,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:54,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:54,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:54,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:54,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:54,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:54,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:54,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:54,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:38:54,124 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 [2023-10-12 17:38:54,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:54,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:54,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:54,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:54,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:54,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:54,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:54,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:54,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:54,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:54,162 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:54,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:38:54,166 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 [2023-10-12 17:38:54,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:54,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:54,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:54,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:54,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:54,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:54,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:54,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:54,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:54,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:54,199 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:54,208 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 [2023-10-12 17:38:54,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:54,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:54,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:54,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:54,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:54,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:54,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:38:54,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:54,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:54,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:54,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:54,243 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:54,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:38:54,247 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 [2023-10-12 17:38:54,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:54,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:54,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:54,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:54,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:54,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:54,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:54,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:54,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:54,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:54,296 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:54,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:38:54,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 [2023-10-12 17:38:54,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:54,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:54,309 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:38:54,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:54,327 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:38:54,327 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:38:54,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:54,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:54,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:54,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:54,372 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:54,384 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 [2023-10-12 17:38:54,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:54,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:54,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:54,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:54,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:38:54,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:54,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:54,416 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:54,453 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:38:54,453 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:38:54,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:54,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:54,461 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:54,468 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:54,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:38:54,494 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:54,494 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:54,495 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:38:54,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:38:54,501 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:54,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:54,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:54,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:54,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:54,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:38:54,559 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:38:54,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:38:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2023-10-12 17:38:54,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 254 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:38:54,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:54,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 254 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:38:54,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:54,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 254 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:38:54,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:54,689 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 215 transitions, 1885 flow [2023-10-12 17:38:54,689 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:38:54,689 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 215 transitions, 1885 flow [2023-10-12 17:38:54,695 ERROR L47 etriNetUnfolderRabin]: [1:1A:[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r][10], 6:4A:[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][15], 19:5A:[163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][35], 45:6A:[168] L34-1-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_22 v_q1_back_38) 0) (<= v_N_12 v_i_20)) InVars {q1=v_q1_22, N=v_N_12, i=v_i_20, q1_back=v_q1_back_38} OutVars{q1=v_q1_22, N=v_N_12, i=v_i_20, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back][25]][47:7A:[169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][80]] [2023-10-12 17:38:54,696 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:54,697 INFO L124 PetriNetUnfolderBase]: 23/46 cut-off events. [2023-10-12 17:38:54,697 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:38:54,697 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:54,697 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 83#[L97-1, L34-1]true [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 102#[L34-1, L98, $Ultimate##0]true [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 104#[L34-1, L98, L58-1]true [168] L34-1-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_22 v_q1_back_38) 0) (<= v_N_12 v_i_20)) InVars {q1=v_q1_22, N=v_N_12, i=v_i_20, q1_back=v_q1_back_38} OutVars{q1=v_q1_22, N=v_N_12, i=v_i_20, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back] 152#[L98, L58-1, thread1EXIT]true [2023-10-12 17:38:54,697 INFO L750 eck$LassoCheckResult]: Loop: 152#[L98, L58-1, thread1EXIT]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 152#[L98, L58-1, thread1EXIT]true [2023-10-12 17:38:54,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash -267468735, now seen corresponding path program 1 times [2023-10-12 17:38:54,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:54,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066650202] [2023-10-12 17:38:54,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:54,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:54,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:54,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:54,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:54,726 INFO L85 PathProgramCache]: Analyzing trace with hash 200, now seen corresponding path program 3 times [2023-10-12 17:38:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:54,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309432506] [2023-10-12 17:38:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:54,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:54,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:54,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:54,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:54,744 INFO L85 PathProgramCache]: Analyzing trace with hash 298403976, now seen corresponding path program 1 times [2023-10-12 17:38:54,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:54,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034031115] [2023-10-12 17:38:54,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:54,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:54,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:54,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:54,910 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:54,911 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:54,911 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:54,911 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:54,911 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:54,911 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:54,911 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:54,911 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:54,911 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:38:54,911 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:54,911 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:54,913 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:54,917 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:54,920 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:54,922 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:54,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:38:54,996 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:54,999 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:55,001 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:55,004 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:55,194 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:55,195 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:55,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:55,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:55,196 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:55,209 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 [2023-10-12 17:38:55,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:55,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:55,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:55,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:55,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:55,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:55,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:38:55,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:55,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:55,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:55,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:55,240 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:55,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:38:55,250 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 [2023-10-12 17:38:55,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:55,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:55,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:55,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:55,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:55,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:55,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:55,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:55,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:55,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:55,282 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:55,291 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 [2023-10-12 17:38:55,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:55,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:55,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:55,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:55,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:55,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:55,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:38:55,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:55,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:55,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:55,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:55,322 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:55,333 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 [2023-10-12 17:38:55,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:55,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:55,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:55,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:55,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:55,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:55,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:38:55,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:55,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:55,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:55,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:55,365 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:55,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:38:55,369 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 [2023-10-12 17:38:55,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:55,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:55,377 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:38:55,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:55,392 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:38:55,392 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:38:55,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:55,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:55,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:55,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:55,426 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:55,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:38:55,430 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 [2023-10-12 17:38:55,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:55,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:55,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:55,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:55,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:55,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:55,456 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:55,473 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:38:55,473 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:38:55,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:55,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:55,477 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:55,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:38:55,481 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:55,513 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:55,513 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:55,513 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:38:55,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:55,519 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:55,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:55,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:55,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:55,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:55,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:38:55,561 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:38:55,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:38:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2023-10-12 17:38:55,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 254 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:38:55,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:55,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 254 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:38:55,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:55,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 254 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:38:55,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:55,665 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 1075 transitions, 11575 flow [2023-10-12 17:38:55,665 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:38:55,665 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 39 places, 1075 transitions, 11575 flow [2023-10-12 17:38:55,687 ERROR L47 etriNetUnfolderRabin]: [1:1A:[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][1], 2:2A:[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][26], 4:3A:[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][76], 9:4A:[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][151], 27:5A:[159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t][226], 66:6A:[170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][326]][67:7A:[170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][501]] [2023-10-12 17:38:55,688 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:55,688 INFO L124 PetriNetUnfolderBase]: 34/66 cut-off events. [2023-10-12 17:38:55,688 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-10-12 17:38:55,688 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:55,688 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 59#[L98, $Ultimate##0, $Ultimate##0]true [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 196#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L99]true [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 198#[L78-1, $Ultimate##0, $Ultimate##0, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 198#[L78-1, $Ultimate##0, $Ultimate##0, L99]true [2023-10-12 17:38:55,689 INFO L750 eck$LassoCheckResult]: Loop: 198#[L78-1, $Ultimate##0, $Ultimate##0, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 198#[L78-1, $Ultimate##0, $Ultimate##0, L99]true [2023-10-12 17:38:55,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:55,689 INFO L85 PathProgramCache]: Analyzing trace with hash -267704302, now seen corresponding path program 1 times [2023-10-12 17:38:55,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:55,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926269047] [2023-10-12 17:38:55,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:55,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:38:55,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:55,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926269047] [2023-10-12 17:38:55,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926269047] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:55,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:38:55,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:38:55,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736272122] [2023-10-12 17:38:55,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:55,740 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:38:55,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash 201, now seen corresponding path program 1 times [2023-10-12 17:38:55,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:55,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701611052] [2023-10-12 17:38:55,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:55,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:55,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:55,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:55,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:55,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:38:55,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:38:55,817 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 39 places, 1075 transitions, 11575 flow. 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) [2023-10-12 17:38:55,817 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:55,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:55,934 INFO L124 PetriNetUnfolderBase]: 268/449 cut-off events. [2023-10-12 17:38:55,935 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-10-12 17:38:55,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2812 conditions, 449 events. 268/449 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1513 event pairs, 26 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 2355. Up to 399 conditions per place. [2023-10-12 17:38:55,940 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 113 selfloop transitions, 5 changer transitions 0/118 dead transitions. [2023-10-12 17:38:55,941 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 38 places, 118 transitions, 1503 flow [2023-10-12 17:38:55,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:38:55,943 INFO L430 stractBuchiCegarLoop]: Abstraction has has 38 places, 118 transitions, 1503 flow [2023-10-12 17:38:55,943 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:38:55,943 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 38 places, 118 transitions, 1503 flow [2023-10-12 17:38:55,974 ERROR L47 etriNetUnfolderRabin]: [1:1A:[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r][2], 6:4A:[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][3], 16:5A:[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][6], 54:6A:[163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][7], 104:7A:[159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t][10], 114:8A:[161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back][4], 174:9A:[169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][22], 233:10A:[170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][58]][234:11A:[170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][66]] [2023-10-12 17:38:55,974 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:55,974 INFO L124 PetriNetUnfolderBase]: 132/233 cut-off events. [2023-10-12 17:38:55,974 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-10-12 17:38:55,974 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:55,976 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 83#[L97-1, L34-1]true [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 102#[L34-1, L98, $Ultimate##0]true [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 214#[L34-1, $Ultimate##0, L99, $Ultimate##0]true [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 216#[L34-1, L58-1, L99, $Ultimate##0]true [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 218#[L34-1, L78-1, L58-1, L99]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 220#[L35-1, L78-1, L58-1, L99]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 220#[L35-1, L78-1, L58-1, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 220#[L35-1, L78-1, L58-1, L99]true [2023-10-12 17:38:55,976 INFO L750 eck$LassoCheckResult]: Loop: 220#[L35-1, L78-1, L58-1, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 220#[L35-1, L78-1, L58-1, L99]true [2023-10-12 17:38:55,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:55,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1320904656, now seen corresponding path program 1 times [2023-10-12 17:38:55,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:55,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288086290] [2023-10-12 17:38:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:55,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:55,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:55,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:55,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:55,998 INFO L85 PathProgramCache]: Analyzing trace with hash 201, now seen corresponding path program 2 times [2023-10-12 17:38:55,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:55,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217887846] [2023-10-12 17:38:55,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:55,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:56,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:56,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:56,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:56,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2001628794, now seen corresponding path program 2 times [2023-10-12 17:38:56,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:56,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716156071] [2023-10-12 17:38:56,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:56,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:56,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:38:56,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:56,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716156071] [2023-10-12 17:38:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716156071] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:56,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:38:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:38:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448315108] [2023-10-12 17:38:56,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:56,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:56,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:38:56,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:38:56,143 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 38 places, 118 transitions, 1503 flow. Second operand has 5 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) [2023-10-12 17:38:56,143 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:56,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:56,264 INFO L124 PetriNetUnfolderBase]: 468/780 cut-off events. [2023-10-12 17:38:56,265 INFO L125 PetriNetUnfolderBase]: For 237/237 co-relation queries the response was YES. [2023-10-12 17:38:56,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5636 conditions, 780 events. 468/780 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3058 event pairs, 28 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 4883. Up to 730 conditions per place. [2023-10-12 17:38:56,274 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 192 selfloop transitions, 32 changer transitions 0/224 dead transitions. [2023-10-12 17:38:56,274 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 41 places, 224 transitions, 3292 flow [2023-10-12 17:38:56,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:38:56,277 INFO L430 stractBuchiCegarLoop]: Abstraction has has 41 places, 224 transitions, 3292 flow [2023-10-12 17:38:56,277 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:38:56,277 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 41 places, 224 transitions, 3292 flow [2023-10-12 17:38:56,313 ERROR L47 etriNetUnfolderRabin]: [1:1A:[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r][2], 6:4A:[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][3], 16:5A:[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][6], 54:6A:[163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][7], 102:7A:[159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t][10], 112:8A:[161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back][4], 174:9A:[169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][22], 241:10A:[169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][38], 312:11A:[170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][85]][314:12A:[170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][102]] [2023-10-12 17:38:56,313 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:56,313 INFO L124 PetriNetUnfolderBase]: 179/313 cut-off events. [2023-10-12 17:38:56,313 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-10-12 17:38:56,313 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:56,314 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 83#[L97-1, L34-1]true [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 102#[L34-1, L98, $Ultimate##0]true [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 214#[L34-1, $Ultimate##0, L99, $Ultimate##0]true [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 216#[L34-1, L58-1, L99, $Ultimate##0]true [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 218#[L34-1, L78-1, L58-1, L99]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 220#[L35-1, L78-1, L58-1, L99]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 220#[L35-1, L78-1, L58-1, L99]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 220#[L35-1, L78-1, L58-1, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 220#[L35-1, L78-1, L58-1, L99]true [2023-10-12 17:38:56,314 INFO L750 eck$LassoCheckResult]: Loop: 220#[L35-1, L78-1, L58-1, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 220#[L35-1, L78-1, L58-1, L99]true [2023-10-12 17:38:56,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:56,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2001628763, now seen corresponding path program 3 times [2023-10-12 17:38:56,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:56,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981314158] [2023-10-12 17:38:56,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:56,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:38:56,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:56,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981314158] [2023-10-12 17:38:56,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981314158] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:56,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:38:56,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-10-12 17:38:56,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013018089] [2023-10-12 17:38:56,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:56,359 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:38:56,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash 201, now seen corresponding path program 3 times [2023-10-12 17:38:56,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:56,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108810550] [2023-10-12 17:38:56,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:56,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:56,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:56,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:56,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:56,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:38:56,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:38:56,432 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 41 places, 224 transitions, 3292 flow. Second operand has 5 states, 5 states have (on average 2.2) 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) [2023-10-12 17:38:56,432 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:56,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:56,569 INFO L124 PetriNetUnfolderBase]: 469/829 cut-off events. [2023-10-12 17:38:56,569 INFO L125 PetriNetUnfolderBase]: For 277/277 co-relation queries the response was YES. [2023-10-12 17:38:56,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6827 conditions, 829 events. 469/829 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3343 event pairs, 32 based on Foata normal form. 0/620 useless extension candidates. Maximal degree in co-relation 5854. Up to 779 conditions per place. [2023-10-12 17:38:56,578 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 207 selfloop transitions, 30 changer transitions 0/237 dead transitions. [2023-10-12 17:38:56,578 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 44 places, 237 transitions, 3969 flow [2023-10-12 17:38:56,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:38:56,579 INFO L430 stractBuchiCegarLoop]: Abstraction has has 44 places, 237 transitions, 3969 flow [2023-10-12 17:38:56,579 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:38:56,579 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 44 places, 237 transitions, 3969 flow [2023-10-12 17:38:56,635 ERROR L47 etriNetUnfolderRabin]: [1:1A:[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r][2], 6:4A:[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][3], 16:5A:[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][6], 54:6A:[163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][7], 102:7A:[159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t][10], 112:8A:[161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back][4], 168:9A:[169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][22], 217:10A:[170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][53], 252:11A:[166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r][63], 279:12A:[161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back][69]][303:13A:[166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r][74], 338:14A:[169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][71], 389:15A:[170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][84], 391:16A:[161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back][120]] [2023-10-12 17:38:56,636 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:56,636 INFO L124 PetriNetUnfolderBase]: 201/390 cut-off events. [2023-10-12 17:38:56,636 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2023-10-12 17:38:56,636 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:56,637 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 83#[L97-1, L34-1]true [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 102#[L34-1, L98, $Ultimate##0]true [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 214#[L34-1, $Ultimate##0, L99, $Ultimate##0]true [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 216#[L34-1, L58-1, L99, $Ultimate##0]true [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 218#[L34-1, L78-1, L58-1, L99]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 220#[L35-1, L78-1, L58-1, L99]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 220#[L35-1, L78-1, L58-1, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 220#[L35-1, L78-1, L58-1, L99]true [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 218#[L34-1, L78-1, L58-1, L99]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 220#[L35-1, L78-1, L58-1, L99]true [2023-10-12 17:38:56,637 INFO L750 eck$LassoCheckResult]: Loop: 220#[L35-1, L78-1, L58-1, L99]true [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 218#[L34-1, L78-1, L58-1, L99]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 218#[L34-1, L78-1, L58-1, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 218#[L34-1, L78-1, L58-1, L99]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 220#[L35-1, L78-1, L58-1, L99]true [2023-10-12 17:38:56,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:56,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1920950507, now seen corresponding path program 1 times [2023-10-12 17:38:56,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:56,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054285219] [2023-10-12 17:38:56,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:56,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:56,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:56,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:56,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash 6036667, now seen corresponding path program 1 times [2023-10-12 17:38:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:56,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440816959] [2023-10-12 17:38:56,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:56,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:56,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:56,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:56,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:56,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1896675493, now seen corresponding path program 2 times [2023-10-12 17:38:56,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:56,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769663155] [2023-10-12 17:38:56,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:56,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:38:56,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:56,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769663155] [2023-10-12 17:38:56,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769663155] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:38:56,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018913411] [2023-10-12 17:38:56,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:38:56,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:38:56,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:56,714 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:38:56,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-10-12 17:38:56,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:38:56,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:38:56,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:56,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:38:56,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:38:56,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018913411] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:56,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:38:56,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2023-10-12 17:38:56,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892153750] [2023-10-12 17:38:56,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:57,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:57,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:38:57,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:38:57,120 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 44 places, 237 transitions, 3969 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:57,120 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:57,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:57,194 INFO L124 PetriNetUnfolderBase]: 207/412 cut-off events. [2023-10-12 17:38:57,194 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2023-10-12 17:38:57,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3841 conditions, 412 events. 207/412 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1606 event pairs, 30 based on Foata normal form. 8/355 useless extension candidates. Maximal degree in co-relation 3354. Up to 362 conditions per place. [2023-10-12 17:38:57,198 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 111 selfloop transitions, 10 changer transitions 0/121 dead transitions. [2023-10-12 17:38:57,199 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 47 places, 121 transitions, 2283 flow [2023-10-12 17:38:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:38:57,199 INFO L430 stractBuchiCegarLoop]: Abstraction has has 47 places, 121 transitions, 2283 flow [2023-10-12 17:38:57,199 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:38:57,199 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 47 places, 121 transitions, 2283 flow [2023-10-12 17:38:57,234 ERROR L47 etriNetUnfolderRabin]: [1:1A:[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][2], 6:4A:[151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r][3], 14:5A:[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][4], 33:6A:[163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][5], 69:7A:[159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t][8], 112:8A:[161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back][6], 168:9A:[169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][24], 217:10A:[170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][53], 252:11A:[166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r][63], 279:12A:[161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back][70]][301:13A:[169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][73], 331:14A:[170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front][84], 363:15A:[166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r][98], 364:16A:[161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back][110]] [2023-10-12 17:38:57,235 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:57,235 INFO L124 PetriNetUnfolderBase]: 185/363 cut-off events. [2023-10-12 17:38:57,235 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2023-10-12 17:38:57,235 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:57,236 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 59#[L98, $Ultimate##0, $Ultimate##0]true [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 102#[L34-1, L98, $Ultimate##0]true [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 214#[L34-1, $Ultimate##0, L99, $Ultimate##0]true [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 216#[L34-1, L58-1, L99, $Ultimate##0]true [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 218#[L34-1, L78-1, L58-1, L99]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 220#[L35-1, L78-1, L58-1, L99]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 220#[L35-1, L78-1, L58-1, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 220#[L35-1, L78-1, L58-1, L99]true [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 218#[L34-1, L78-1, L58-1, L99]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 220#[L35-1, L78-1, L58-1, L99]true [2023-10-12 17:38:57,236 INFO L750 eck$LassoCheckResult]: Loop: 220#[L35-1, L78-1, L58-1, L99]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 220#[L35-1, L78-1, L58-1, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 220#[L35-1, L78-1, L58-1, L99]true [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 218#[L34-1, L78-1, L58-1, L99]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 220#[L35-1, L78-1, L58-1, L99]true [2023-10-12 17:38:57,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:57,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1918324731, now seen corresponding path program 3 times [2023-10-12 17:38:57,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:57,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036976034] [2023-10-12 17:38:57,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:57,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:57,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:57,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:57,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:57,251 INFO L85 PathProgramCache]: Analyzing trace with hash 6126877, now seen corresponding path program 2 times [2023-10-12 17:38:57,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:57,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161073805] [2023-10-12 17:38:57,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:57,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:57,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:57,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:57,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:57,261 INFO L85 PathProgramCache]: Analyzing trace with hash -700956649, now seen corresponding path program 4 times [2023-10-12 17:38:57,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:57,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473509503] [2023-10-12 17:38:57,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:57,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:57,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:57,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:58,037 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:58,037 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:58,037 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:58,037 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:58,037 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:58,037 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:58,038 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:58,038 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:58,038 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_BEv2_Iteration9_Lasso [2023-10-12 17:38:58,038 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:58,038 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:58,046 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:58,049 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:58,052 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:58,060 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:58,063 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:58,065 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:58,379 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:58,382 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:59,334 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:59,335 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:59,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:59,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:59,341 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:59,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:38:59,345 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 [2023-10-12 17:38:59,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:59,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:59,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:59,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:59,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:59,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:59,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:59,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:59,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:59,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:59,362 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:59,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:38:59,366 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 [2023-10-12 17:38:59,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:59,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:59,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:59,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:59,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:59,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:59,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:59,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:59,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:59,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:59,397 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:59,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:38:59,400 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 [2023-10-12 17:38:59,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:59,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:59,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:59,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:59,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:59,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:59,411 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:59,420 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:38:59,420 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:38:59,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:59,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:59,428 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:59,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:38:59,430 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:59,438 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:59,439 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:59,439 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:38:59,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-10-12 17:38:59,454 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2023-10-12 17:38:59,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:59,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:59,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:59,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:59,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:38:59,519 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 [2023-10-12 17:38:59,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:38:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 324 transitions. [2023-10-12 17:38:59,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 324 transitions. Stem has 12 letters. Loop has 4 letters. [2023-10-12 17:38:59,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:59,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 324 transitions. Stem has 16 letters. Loop has 4 letters. [2023-10-12 17:38:59,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:59,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 324 transitions. Stem has 12 letters. Loop has 8 letters. [2023-10-12 17:38:59,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:59,675 INFO L430 stractBuchiCegarLoop]: Abstraction has has 53 places, 726 transitions, 15150 flow [2023-10-12 17:38:59,675 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:38:59,676 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 53 places, 726 transitions, 15150 flow [2023-10-12 17:38:59,762 INFO L124 PetriNetUnfolderBase]: 207/415 cut-off events. [2023-10-12 17:38:59,762 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2023-10-12 17:38:59,762 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:38:59,767 INFO L201 PluginConnector]: Adding new model ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:38:59 BoogieIcfgContainer [2023-10-12 17:38:59,767 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:38:59,767 INFO L158 Benchmark]: Toolchain (without parser) took 8390.70ms. Allocated memory was 169.9MB in the beginning and 295.7MB in the end (delta: 125.8MB). Free memory was 117.9MB in the beginning and 160.8MB in the end (delta: -42.9MB). Peak memory consumption was 85.4MB. Max. memory is 8.0GB. [2023-10-12 17:38:59,767 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.38ms. Allocated memory is still 169.9MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:38:59,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.66ms. Allocated memory is still 169.9MB. Free memory was 117.9MB in the beginning and 116.4MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-10-12 17:38:59,768 INFO L158 Benchmark]: Boogie Preprocessor took 29.36ms. Allocated memory is still 169.9MB. Free memory was 116.4MB in the beginning and 115.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:59,768 INFO L158 Benchmark]: RCFGBuilder took 290.32ms. Allocated memory is still 169.9MB. Free memory was 115.1MB in the beginning and 103.1MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-10-12 17:38:59,768 INFO L158 Benchmark]: BuchiAutomizer took 8037.96ms. Allocated memory was 169.9MB in the beginning and 295.7MB in the end (delta: 125.8MB). Free memory was 102.8MB in the beginning and 160.8MB in the end (delta: -58.0MB). Peak memory consumption was 68.6MB. Max. memory is 8.0GB. [2023-10-12 17:38:59,769 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.38ms. Allocated memory is still 169.9MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.66ms. Allocated memory is still 169.9MB. Free memory was 117.9MB in the beginning and 116.4MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.36ms. Allocated memory is still 169.9MB. Free memory was 116.4MB in the beginning and 115.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 290.32ms. Allocated memory is still 169.9MB. Free memory was 115.1MB in the beginning and 103.1MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 8037.96ms. Allocated memory was 169.9MB in the beginning and 295.7MB in the end (delta: 125.8MB). Free memory was 102.8MB in the beginning and 160.8MB in the end (delta: -58.0MB). Peak memory consumption was 68.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (6 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 4 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 10 iterations. TraceHistogramMax:0. Analysis of lassos took 5.5s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 564 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 561 mSDsluCounter, 351 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 621 IncrementalHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 213 mSDtfsCounter, 621 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital138 mio100 ax100 hnf100 lsp84 ukn88 mio100 lsp62 div100 bol116 ite100 ukn100 eq173 hnf90 smp100 dnf446 smp45 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 70ms VariablesStem: 4 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 46 PlacesBefore, 26 PlacesAfterwards, 39 TransitionsBefore, 19 TransitionsAfterwards, 634 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 21 TotalNumberOfCompositions, 565 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 492, independent: 480, independent conditional: 0, independent unconditional: 480, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 393, independent: 383, independent conditional: 0, independent unconditional: 383, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 393, independent: 378, independent conditional: 0, independent unconditional: 378, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 492, independent: 97, independent conditional: 0, independent unconditional: 97, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 393, unknown conditional: 0, unknown unconditional: 393] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:38:59,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:59,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:00,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...