/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/parallel/misc-4.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:38:31,580 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:38:31,619 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:31,639 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:38:31,639 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:38:31,639 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:38:31,640 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:38:31,641 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:38:31,641 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:38:31,641 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:38:31,641 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:38:31,642 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:38:31,642 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:38:31,642 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:38:31,642 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:38:31,643 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:38:31,643 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:38:31,643 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:38:31,644 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:38:31,644 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:38:31,644 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:38:31,648 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:38:31,648 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:38:31,649 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:38:31,649 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:38:31,649 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:38:31,649 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:38:31,650 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:38:31,650 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:38:31,650 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:38:31,650 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:38:31,651 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:38:31,651 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:38:31,652 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:38:31,653 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:31,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:38:31,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:38:31,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:38:31,841 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:38:31,842 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:38:31,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-4.wvr.bpl [2023-10-12 17:38:31,843 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-4.wvr.bpl' [2023-10-12 17:38:31,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:38:31,869 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:38:31,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:31,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:38:31,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:38:31,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:31" (1/1) ... [2023-10-12 17:38:31,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:31" (1/1) ... [2023-10-12 17:38:31,891 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:38:31,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:31,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:38:31,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:38:31,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:38:31,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:31" (1/1) ... [2023-10-12 17:38:31,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:31" (1/1) ... [2023-10-12 17:38:31,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:31" (1/1) ... [2023-10-12 17:38:31,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:31" (1/1) ... [2023-10-12 17:38:31,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:31" (1/1) ... [2023-10-12 17:38:31,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:31" (1/1) ... [2023-10-12 17:38:31,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:31" (1/1) ... [2023-10-12 17:38:31,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:31" (1/1) ... [2023-10-12 17:38:31,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:38:31,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:38:31,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:38:31,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:38:31,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:31" (1/1) ... [2023-10-12 17:38:31,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:31,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:31,938 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:31,977 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:31,987 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:38:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:38:31,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:38:31,988 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:38:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:38:31,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:38:31,988 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:38:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:38:31,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:38:31,989 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:38:31,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:38:31,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:38:31,990 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:32,030 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:38:32,031 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:38:32,136 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:38:32,141 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:38:32,141 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:38:32,142 INFO L201 PluginConnector]: Adding new model misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:32 BoogieIcfgContainer [2023-10-12 17:38:32,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:38:32,143 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:38:32,143 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:38:32,146 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:38:32,146 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:32,146 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:31" (1/2) ... [2023-10-12 17:38:32,147 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38a46bf5 and model type misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:38:32, skipping insertion in model container [2023-10-12 17:38:32,147 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:32,147 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:32" (2/2) ... [2023-10-12 17:38:32,148 INFO L332 chiAutomizerObserver]: Analyzing ICFG misc-4.wvr.bpl [2023-10-12 17:38:32,191 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:38:32,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 92 flow [2023-10-12 17:38:32,242 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2023-10-12 17:38:32,243 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:32,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 4/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2023-10-12 17:38:32,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 34 transitions, 92 flow [2023-10-12 17:38:32,249 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 28 transitions, 74 flow [2023-10-12 17:38:32,251 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:38:32,260 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 28 transitions, 74 flow [2023-10-12 17:38:32,265 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 28 transitions, 74 flow [2023-10-12 17:38:32,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 74 flow [2023-10-12 17:38:32,270 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2023-10-12 17:38:32,270 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:32,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 4/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2023-10-12 17:38:32,272 INFO L119 LiptonReduction]: Number of co-enabled transitions 264 [2023-10-12 17:38:32,701 INFO L134 LiptonReduction]: Checked pairs total: 405 [2023-10-12 17:38:32,701 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:38:32,712 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:38:32,713 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:38:32,713 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:38:32,713 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:38:32,713 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:38:32,713 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:38:32,713 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:38:32,713 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:38:32,714 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 20 transitions, 58 flow [2023-10-12 17:38:32,717 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][6], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1]][5:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][13], 6:4A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][11]] [2023-10-12 17:38:32,719 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:32,719 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:38:32,719 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:32,719 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:32,721 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:38:32,721 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 20 transitions, 58 flow [2023-10-12 17:38:32,723 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][6], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1]][5:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][13], 6:4A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][11]] [2023-10-12 17:38:32,723 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:32,723 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:38:32,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:32,723 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:32,727 INFO L748 eck$LassoCheckResult]: Stem: 41#[$Ultimate##0]true [64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[] 43#[L56]true [96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0] 45#[L17, L56-1]true [2023-10-12 17:38:32,727 INFO L750 eck$LassoCheckResult]: Loop: 45#[L17, L56-1]true [104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[] 48#[L56-1, L19]true [107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos] 45#[L17, L56-1]true [2023-10-12 17:38:32,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:32,730 INFO L85 PathProgramCache]: Analyzing trace with hash 3041, now seen corresponding path program 1 times [2023-10-12 17:38:32,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:32,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865973641] [2023-10-12 17:38:32,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:32,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:32,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:32,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:32,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash 4292, now seen corresponding path program 1 times [2023-10-12 17:38:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:32,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357759959] [2023-10-12 17:38:32,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:32,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:32,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:32,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:32,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:32,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2925732, now seen corresponding path program 1 times [2023-10-12 17:38:32,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:32,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090723503] [2023-10-12 17:38:32,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:32,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:32,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:32,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:32,895 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:32,896 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:32,896 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:32,896 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:32,896 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:38:32,896 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:32,896 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:32,896 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:32,896 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:38:32,896 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:32,896 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:32,906 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:32,912 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:32,915 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:32,942 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:32,942 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:38:32,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:32,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:32,946 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:32,949 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:32,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:38:32,950 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:32,974 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:38:32,974 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite v_assert 1 0)_1=1} Honda state: {v_rep(ite v_assert 1 0)_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:38:32,980 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:32,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:32,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:32,982 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:32,987 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:38:32,987 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:32,996 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:33,013 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:33,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:33,078 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:33,079 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:33,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:38:33,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:33,099 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:38:33,100 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {pos=0} Honda state: {pos=0} Generalized eigenvectors: [{pos=1}, {pos=7}, {pos=-7}] Lambdas: [1, 1, 1] Nus: [0, 0] [2023-10-12 17:38:33,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:38:33,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:33,117 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:33,118 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:33,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:38:33,119 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:33,128 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:33,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:33,131 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:33,132 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:33,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:38:33,134 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:33,185 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:38:33,189 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:33,190 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:33,190 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:33,190 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:33,190 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:33,190 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:33,190 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,190 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:33,190 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:33,190 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:38:33,190 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:33,190 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:33,192 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:33,195 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:33,199 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:33,226 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:33,229 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:33,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:33,232 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:33,232 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:33,235 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:33,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:33,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:38:33,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:33,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:33,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:33,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:38:33,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:38:33,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:33,257 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:33,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:33,259 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:33,260 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:33,261 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:33,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:33,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:38:33,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:33,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:33,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:33,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:38:33,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:38:33,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:33,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:38:33,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:33,284 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:33,285 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:33,287 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:33,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:33,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:38:33,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:33,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:33,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:33,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:38:33,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:38:33,321 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:33,323 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:38:33,324 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:38:33,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:33,326 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:33,328 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:33,354 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:33,355 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:38:33,355 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:33,355 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d1 1 0)_2) = 1*v_rep(ite d1 1 0)_2 Supporting invariants [] [2023-10-12 17:38:33,358 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:33,360 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:33,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:33,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:33,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:33,405 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:33,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:33,419 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:33,453 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:33,564 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:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2023-10-12 17:38:33,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:38:33,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:33,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:38:33,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:33,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 2 letters. Loop has 4 letters. [2023-10-12 17:38:33,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:33,573 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 120 transitions, 588 flow [2023-10-12 17:38:33,573 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:38:33,573 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 120 transitions, 588 flow [2023-10-12 17:38:33,577 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][37], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][7], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][29]][23:4A:[110] L33-->L39: Formula: (and (not v_d2_16) v_v_assert_37) InVars {d2=v_d2_16, v_assert=v_v_assert_37} OutVars{d2=v_d2_16, v_assert=v_v_assert_37} AuxVars[] AssignedVars[][92], 24:5A:[102] L39-->L33: Formula: (and (= (+ 2 v_pos_23) v_pos_24) (or (and (not v_d2_11) v_d2_10) (and (not v_d2_10) v_d2_11))) InVars {d2=v_d2_11, pos=v_pos_24} OutVars{d2=v_d2_10, pos=v_pos_23} AuxVars[] AssignedVars[d2, pos][86]] [2023-10-12 17:38:33,577 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:33,577 INFO L124 PetriNetUnfolderBase]: 11/23 cut-off events. [2023-10-12 17:38:33,577 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:38:33,577 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:33,578 INFO L748 eck$LassoCheckResult]: Stem: 41#[$Ultimate##0]true [64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[] 43#[L56]true [96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0] 45#[L17, L56-1]true [90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 89#[L33, L17, L57]true [2023-10-12 17:38:33,578 INFO L750 eck$LassoCheckResult]: Loop: 89#[L33, L17, L57]true [110] L33-->L39: Formula: (and (not v_d2_16) v_v_assert_37) InVars {d2=v_d2_16, v_assert=v_v_assert_37} OutVars{d2=v_d2_16, v_assert=v_v_assert_37} AuxVars[] AssignedVars[] 92#[L39, L17, L57]true [102] L39-->L33: Formula: (and (= (+ 2 v_pos_23) v_pos_24) (or (and (not v_d2_11) v_d2_10) (and (not v_d2_10) v_d2_11))) InVars {d2=v_d2_11, pos=v_pos_24} OutVars{d2=v_d2_10, pos=v_pos_23} AuxVars[] AssignedVars[d2, pos] 89#[L33, L17, L57]true [2023-10-12 17:38:33,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:33,578 INFO L85 PathProgramCache]: Analyzing trace with hash 94361, now seen corresponding path program 1 times [2023-10-12 17:38:33,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:33,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716961521] [2023-10-12 17:38:33,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:33,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:33,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:33,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:33,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:33,585 INFO L85 PathProgramCache]: Analyzing trace with hash 4473, now seen corresponding path program 1 times [2023-10-12 17:38:33,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:33,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341279048] [2023-10-12 17:38:33,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:33,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:33,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:33,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:33,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:33,590 INFO L85 PathProgramCache]: Analyzing trace with hash 90684433, now seen corresponding path program 1 times [2023-10-12 17:38:33,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:33,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475713379] [2023-10-12 17:38:33,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:33,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:33,628 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:33,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:33,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475713379] [2023-10-12 17:38:33,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475713379] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:33,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:38:33,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:38:33,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813677389] [2023-10-12 17:38:33,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:33,660 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:33,661 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:33,661 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:33,661 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:33,661 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:38:33,661 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,661 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:33,661 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:33,661 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:38:33,661 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:33,661 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:33,662 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:33,664 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:33,667 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:33,686 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:33,686 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:38:33,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:33,687 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:33,689 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:33,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:38:33,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:33,713 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:38:33,713 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite v_assert 1 0)_3=1} Honda state: {v_rep(ite v_assert 1 0)_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:38:33,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-10-12 17:38:33,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:33,725 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:33,727 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:33,729 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:38:33,729 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:33,748 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:33,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:33,765 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:33,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:38:33,771 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:33,777 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:33,794 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:38:33,794 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {pos=0} Honda state: {pos=0} Generalized eigenvectors: [{pos=0}, {pos=-1}, {pos=-1}] Lambdas: [6, 0, 1] Nus: [0, 1] [2023-10-12 17:38:33,799 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:33,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:33,805 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:33,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:38:33,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:33,816 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:33,835 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:33,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:33,836 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:33,838 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:33,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:38:33,840 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:33,865 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:38:33,869 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:33,870 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:33,870 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:33,870 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:33,870 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:33,870 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:33,870 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,870 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:33,870 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:33,870 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:38:33,870 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:33,870 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:33,871 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:33,874 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:33,878 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:33,900 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:33,900 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:33,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:33,901 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:33,903 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:33,905 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:33,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:33,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:38:33,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:33,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:33,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:33,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:38:33,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:38:33,929 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:33,935 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:33,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:33,936 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:33,952 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:33,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:33,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:38:33,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:33,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:33,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:33,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:38:33,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:38:33,960 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:33,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:33,972 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:33,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:33,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:33,973 INFO L229 MonitoredProcess]: Starting monitored process 18 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:33,977 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:33,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:33,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:38:33,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:33,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:33,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:33,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:38:33,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:38:33,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:38:33,996 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:34,005 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:38:34,005 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:38:34,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:34,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:34,009 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:34,010 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:34,011 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:34,011 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:38:34,011 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:34,011 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d2 1 0)_2) = -2*v_rep(ite d2 1 0)_2 + 1 Supporting invariants [] [2023-10-12 17:38:34,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:34,015 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:34,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:34,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:34,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:34,042 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:34,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:34,054 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:34,055 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:34,164 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:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:34,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2023-10-12 17:38:34,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:38:34,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:34,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:38:34,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:34,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:38:34,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:34,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:34,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:38:34,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:38:34,172 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 38 places, 720 transitions, 4968 flow. Second operand has 3 states, 3 states have (on average 1.6666666666666667) 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:34,172 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:34,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:34,319 INFO L124 PetriNetUnfolderBase]: 508/757 cut-off events. [2023-10-12 17:38:34,320 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-10-12 17:38:34,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3233 conditions, 757 events. 508/757 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2740 event pairs, 14 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 2910. Up to 448 conditions per place. [2023-10-12 17:38:34,330 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 135 selfloop transitions, 13 changer transitions 0/148 dead transitions. [2023-10-12 17:38:34,331 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 36 places, 148 transitions, 1286 flow [2023-10-12 17:38:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:38:34,332 INFO L430 stractBuchiCegarLoop]: Abstraction has has 36 places, 148 transitions, 1286 flow [2023-10-12 17:38:34,332 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:38:34,332 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 36 places, 148 transitions, 1286 flow [2023-10-12 17:38:34,342 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][2], 13:4A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][9]][74:5A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][25], 80:6A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][52]] [2023-10-12 17:38:34,343 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[105] L17-->L23: Formula: (and (not v_d1_8) v_v_assert_21) InVars {d1=v_d1_8, v_assert=v_v_assert_21} OutVars{d1=v_d1_8, v_assert=v_v_assert_21} AuxVars[] AssignedVars[][3], 30:4A:[106] L23-->L17: Formula: (and (= (+ v_pos_47 1) v_pos_48) (or (and (not v_d1_10) v_d1_11) (and (not v_d1_11) v_d1_10))) InVars {d1=v_d1_11, pos=v_pos_48} OutVars{d1=v_d1_10, pos=v_pos_47} AuxVars[] AssignedVars[d1, pos][13]][92:5A:[105] L17-->L23: Formula: (and (not v_d1_8) v_v_assert_21) InVars {d1=v_d1_8, v_assert=v_v_assert_21} OutVars{d1=v_d1_8, v_assert=v_v_assert_21} AuxVars[] AssignedVars[][31], 93:6A:[106] L23-->L17: Formula: (and (= (+ v_pos_47 1) v_pos_48) (or (and (not v_d1_10) v_d1_11) (and (not v_d1_11) v_d1_10))) InVars {d1=v_d1_11, pos=v_pos_48} OutVars{d1=v_d1_10, pos=v_pos_47} AuxVars[] AssignedVars[d1, pos][66]] [2023-10-12 17:38:34,344 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:34,344 INFO L124 PetriNetUnfolderBase]: 59/92 cut-off events. [2023-10-12 17:38:34,344 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-10-12 17:38:34,344 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:34,344 INFO L748 eck$LassoCheckResult]: Stem: 41#[$Ultimate##0]true [64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[] 43#[L56]true [96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0] 45#[L17, L56-1]true [105] L17-->L23: Formula: (and (not v_d1_8) v_v_assert_21) InVars {d1=v_d1_8, v_assert=v_v_assert_21} OutVars{d1=v_d1_8, v_assert=v_v_assert_21} AuxVars[] AssignedVars[] 131#[L23, L56-1]true [106] L23-->L17: Formula: (and (= (+ v_pos_47 1) v_pos_48) (or (and (not v_d1_10) v_d1_11) (and (not v_d1_11) v_d1_10))) InVars {d1=v_d1_11, pos=v_pos_48} OutVars{d1=v_d1_10, pos=v_pos_47} AuxVars[] AssignedVars[d1, pos] 45#[L17, L56-1]true [2023-10-12 17:38:34,344 INFO L750 eck$LassoCheckResult]: Loop: 45#[L17, L56-1]true [105] L17-->L23: Formula: (and (not v_d1_8) v_v_assert_21) InVars {d1=v_d1_8, v_assert=v_v_assert_21} OutVars{d1=v_d1_8, v_assert=v_v_assert_21} AuxVars[] AssignedVars[] 131#[L23, L56-1]true [106] L23-->L17: Formula: (and (= (+ v_pos_47 1) v_pos_48) (or (and (not v_d1_10) v_d1_11) (and (not v_d1_11) v_d1_10))) InVars {d1=v_d1_11, pos=v_pos_48} OutVars{d1=v_d1_10, pos=v_pos_47} AuxVars[] AssignedVars[d1, pos] 45#[L17, L56-1]true [2023-10-12 17:38:34,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:34,345 INFO L85 PathProgramCache]: Analyzing trace with hash 2925762, now seen corresponding path program 1 times [2023-10-12 17:38:34,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:34,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543816587] [2023-10-12 17:38:34,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:34,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:34,355 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:34,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:34,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543816587] [2023-10-12 17:38:34,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543816587] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:34,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:38:34,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:38:34,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888844085] [2023-10-12 17:38:34,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:34,356 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:38:34,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash 4322, now seen corresponding path program 1 times [2023-10-12 17:38:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:34,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178861004] [2023-10-12 17:38:34,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:34,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:34,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:34,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:34,401 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:34,401 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:34,401 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:34,401 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:34,401 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:38:34,401 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:34,401 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:34,401 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:34,401 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:38:34,401 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:34,401 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:34,402 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:34,406 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:34,410 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:34,435 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:34,435 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:38:34,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:34,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:34,436 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:34,441 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:34,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:38:34,450 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:34,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-10-12 17:38:34,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:34,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:34,480 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:34,482 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:34,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:38:34,486 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:34,503 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:38:34,503 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {pos=0} Honda state: {pos=0} Generalized eigenvectors: [{pos=1}, {pos=-1}, {pos=-1}] Lambdas: [1, 0, 1] Nus: [0, 1] [2023-10-12 17:38:34,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:34,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:34,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:34,507 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:34,508 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:34,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:38:34,510 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:34,531 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:34,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:34,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:34,533 INFO L229 MonitoredProcess]: Starting monitored process 23 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:34,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:34,567 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:38:34,567 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:34,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:38:34,591 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:38:34,594 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:34,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:34,596 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:34,596 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:34,596 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:34,596 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:34,596 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:34,596 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:34,596 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:34,596 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:34,597 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:38:34,597 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:34,597 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:34,597 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:34,604 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:34,608 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:34,626 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:34,626 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:34,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:34,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:34,731 INFO L229 MonitoredProcess]: Starting monitored process 24 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:34,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:38:34,734 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:34,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:34,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:38:34,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:34,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:34,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:34,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:38:34,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:38:34,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:34,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-10-12 17:38:34,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:34,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:34,746 INFO L229 MonitoredProcess]: Starting monitored process 25 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:34,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-10-12 17:38:34,749 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:34,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:34,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:38:34,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:34,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:34,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:34,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:38:34,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:38:34,764 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:34,766 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:38:34,766 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:38:34,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:34,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:34,767 INFO L229 MonitoredProcess]: Starting monitored process 26 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:34,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-10-12 17:38:34,769 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:34,770 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:38:34,770 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:34,770 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d1 1 0)_4) = -2*v_rep(ite d1 1 0)_4 + 1 Supporting invariants [] [2023-10-12 17:38:34,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:34,773 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:34,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:34,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:34,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:34,799 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:34,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:34,809 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:34,809 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:34,894 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:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:34,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2023-10-12 17:38:34,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:38:34,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:34,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:38:34,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:34,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:38:34,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:34,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:34,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:38:34,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:38:34,896 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 42 places, 888 transitions, 9492 flow. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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:34,896 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:34,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:35,045 INFO L124 PetriNetUnfolderBase]: 904/1354 cut-off events. [2023-10-12 17:38:35,046 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-10-12 17:38:35,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8489 conditions, 1354 events. 904/1354 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5282 event pairs, 9 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 7638. Up to 946 conditions per place. [2023-10-12 17:38:35,059 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 279 selfloop transitions, 37 changer transitions 0/316 dead transitions. [2023-10-12 17:38:35,059 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 43 places, 316 transitions, 4026 flow [2023-10-12 17:38:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:38:35,060 INFO L430 stractBuchiCegarLoop]: Abstraction has has 43 places, 316 transitions, 4026 flow [2023-10-12 17:38:35,060 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:38:35,060 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 43 places, 316 transitions, 4026 flow [2023-10-12 17:38:35,062 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3]][19:4A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][10], 20:5A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][25]] [2023-10-12 17:38:35,065 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][2], 11:4A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][8]][55:5A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][21], 56:6A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][45]] [2023-10-12 17:38:35,066 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][2], 6:4A:[108] L33-->thread2EXIT: Formula: (not v_v_assert_30) InVars {v_assert=v_v_assert_30} OutVars{v_assert=v_v_assert_30} AuxVars[] AssignedVars[][5], 31:5A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][14]][71:6A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][21], 72:7A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][45]] [2023-10-12 17:38:35,067 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][2], 7:4A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][6], 36:5A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][14]][82:6A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][21], 83:7A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][45]] [2023-10-12 17:38:35,068 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][2], 7:4A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][6], 40:5A:[101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos][16]][88:6A:[110] L33-->L39: Formula: (and (not v_d2_16) v_v_assert_37) InVars {d2=v_d2_16, v_assert=v_v_assert_37} OutVars{d2=v_d2_16, v_assert=v_v_assert_37} AuxVars[] AssignedVars[][35], 90:7A:[102] L39-->L33: Formula: (and (= (+ 2 v_pos_23) v_pos_24) (or (and (not v_d2_11) v_d2_10) (and (not v_d2_10) v_d2_11))) InVars {d2=v_d2_11, pos=v_pos_24} OutVars{d2=v_d2_10, pos=v_pos_23} AuxVars[] AssignedVars[d2, pos][62]] [2023-10-12 17:38:35,068 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:35,068 INFO L124 PetriNetUnfolderBase]: 50/89 cut-off events. [2023-10-12 17:38:35,068 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-10-12 17:38:35,069 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:35,069 INFO L748 eck$LassoCheckResult]: Stem: 41#[$Ultimate##0]true [64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[] 43#[L56]true [96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0] 45#[L17, L56-1]true [90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 89#[L33, L17, L57]true [109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[] 175#[L17, L35, L57]true [101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos] 89#[L33, L17, L57]true [2023-10-12 17:38:35,069 INFO L750 eck$LassoCheckResult]: Loop: 89#[L33, L17, L57]true [110] L33-->L39: Formula: (and (not v_d2_16) v_v_assert_37) InVars {d2=v_d2_16, v_assert=v_v_assert_37} OutVars{d2=v_d2_16, v_assert=v_v_assert_37} AuxVars[] AssignedVars[] 92#[L39, L17, L57]true [102] L39-->L33: Formula: (and (= (+ 2 v_pos_23) v_pos_24) (or (and (not v_d2_11) v_d2_10) (and (not v_d2_10) v_d2_11))) InVars {d2=v_d2_11, pos=v_pos_24} OutVars{d2=v_d2_10, pos=v_pos_23} AuxVars[] AssignedVars[d2, pos] 89#[L33, L17, L57]true [2023-10-12 17:38:35,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:35,069 INFO L85 PathProgramCache]: Analyzing trace with hash 90684401, now seen corresponding path program 1 times [2023-10-12 17:38:35,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:35,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941211626] [2023-10-12 17:38:35,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:35,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:35,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:35,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:35,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:35,076 INFO L85 PathProgramCache]: Analyzing trace with hash 4473, now seen corresponding path program 2 times [2023-10-12 17:38:35,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:35,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303635067] [2023-10-12 17:38:35,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:35,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:35,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:35,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:35,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:35,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1248366953, now seen corresponding path program 1 times [2023-10-12 17:38:35,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:35,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768374652] [2023-10-12 17:38:35,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:35,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:35,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:35,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:35,112 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:35,113 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:35,113 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:35,113 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:35,113 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:38:35,113 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:35,113 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:35,113 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:35,113 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_BEv2_Iteration4_Loop [2023-10-12 17:38:35,113 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:35,113 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:35,113 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:35,117 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:35,118 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:35,135 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:35,135 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:38:35,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:35,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:35,136 INFO L229 MonitoredProcess]: Starting monitored process 27 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:35,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-10-12 17:38:35,139 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:38:35,140 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:35,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:35,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:35,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:35,173 INFO L229 MonitoredProcess]: Starting monitored process 28 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:35,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-10-12 17:38:35,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:38:35,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:35,189 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:38:35,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-10-12 17:38:35,192 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:35,192 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:35,192 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:35,192 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:35,192 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:35,192 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:35,192 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:35,192 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:35,192 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_BEv2_Iteration4_Loop [2023-10-12 17:38:35,192 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:35,192 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:35,193 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:35,197 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:35,210 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:35,228 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:35,228 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:35,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:35,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:35,237 INFO L229 MonitoredProcess]: Starting monitored process 29 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:35,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-10-12 17:38:35,241 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:35,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:35,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:38:35,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:35,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:35,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:35,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:38:35,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:38:35,272 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:35,285 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:38:35,285 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:38:35,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:35,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:35,287 INFO L229 MonitoredProcess]: Starting monitored process 30 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:35,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-10-12 17:38:35,291 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:35,291 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:38:35,292 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:35,292 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d2 1 0)_4) = -2*v_rep(ite d2 1 0)_4 + 1 Supporting invariants [] [2023-10-12 17:38:35,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:35,297 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:35,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:35,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:35,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:35,320 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:35,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:35,330 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:35,331 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:35,411 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:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2023-10-12 17:38:35,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:38:35,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:35,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:38:35,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:35,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:38:35,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:35,414 INFO L430 stractBuchiCegarLoop]: Abstraction has has 49 places, 1896 transitions, 27948 flow [2023-10-12 17:38:35,414 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:38:35,414 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 49 places, 1896 transitions, 27948 flow [2023-10-12 17:38:35,421 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][4], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][10], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][22]][19:4A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][64], 20:5A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][154]] [2023-10-12 17:38:35,441 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][4], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][10], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][16], 11:4A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][52]][52:5A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][130], 53:6A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][274]] [2023-10-12 17:38:35,444 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][4], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][10], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][16], 6:4A:[108] L33-->thread2EXIT: Formula: (not v_v_assert_30) InVars {v_assert=v_v_assert_30} OutVars{v_assert=v_v_assert_30} AuxVars[] AssignedVars[][34], 31:5A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][88]][68:6A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][130], 69:7A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][274]] [2023-10-12 17:38:35,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:35,448 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][4], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][10], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][16], 7:4A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][40], 36:5A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][88]][76:6A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][130], 77:7A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][274]] [2023-10-12 17:38:35,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:35,460 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][4], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][10], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][16], 8:4A:[93] L57-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2][46], 41:5A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][88]][116:6A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][130], 117:7A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][274]] [2023-10-12 17:38:35,467 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][4], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][10], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][16], 6:4A:[108] L33-->thread2EXIT: Formula: (not v_v_assert_30) InVars {v_assert=v_v_assert_30} OutVars{v_assert=v_v_assert_30} AuxVars[] AssignedVars[][34], 30:5A:[93] L57-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2][82], 63:6A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][88]][164:7A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][130], 165:8A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][274]] [2023-10-12 17:38:35,470 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][4], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][10], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][16], 7:4A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][40], 35:5A:[93] L57-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2][82], 70:6A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][88]][179:7A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][130], 180:8A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][274]] [2023-10-12 17:38:35,482 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][4], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][10], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][16], 8:4A:[93] L57-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2][46], 47:5A:[111] $Ultimate##0-->thread3EXIT: Formula: (or (and v_v_assert_42 (<= 0 v_pos_77)) (and (not v_v_assert_42) (< v_pos_77 0))) InVars {pos=v_pos_77} OutVars{pos=v_pos_77, v_assert=v_v_assert_42} AuxVars[] AssignedVars[v_assert][106], 113:6A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][88]][258:7A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][130], 259:8A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][274]] [2023-10-12 17:38:35,487 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][4], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][10], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][16], 6:4A:[108] L33-->thread2EXIT: Formula: (not v_v_assert_30) InVars {v_assert=v_v_assert_30} OutVars{v_assert=v_v_assert_30} AuxVars[] AssignedVars[][34], 30:5A:[93] L57-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2][82], 65:6A:[111] $Ultimate##0-->thread3EXIT: Formula: (or (and v_v_assert_42 (<= 0 v_pos_77)) (and (not v_v_assert_42) (< v_pos_77 0))) InVars {pos=v_pos_77} OutVars{pos=v_pos_77, v_assert=v_v_assert_42} AuxVars[] AssignedVars[v_assert][106], 163:7A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][88]][291:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][130], 292:9A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][274]] [2023-10-12 17:38:35,490 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][4], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][10], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][16], 7:4A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][40], 35:5A:[93] L57-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2][82], 73:6A:[111] $Ultimate##0-->thread3EXIT: Formula: (or (and v_v_assert_42 (<= 0 v_pos_77)) (and (not v_v_assert_42) (< v_pos_77 0))) InVars {pos=v_pos_77} OutVars{pos=v_pos_77, v_assert=v_v_assert_42} AuxVars[] AssignedVars[v_assert][106], 178:7A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][88]][305:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][130], 306:9A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][274]] [2023-10-12 17:38:35,506 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][4], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][10], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][16], 7:4A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][40], 36:5A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][88], 78:6A:[101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos][196], 232:7A:[108] L33-->thread2EXIT: Formula: (not v_v_assert_30) InVars {v_assert=v_v_assert_30} OutVars{v_assert=v_v_assert_30} AuxVars[] AssignedVars[][345]][417:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][362], 419:9A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][596]] [2023-10-12 17:38:35,507 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][4], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][10], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][16], 7:4A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][40], 36:5A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][88], 78:6A:[101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos][196], 234:7A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][351]][422:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][560], 425:9A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][806]] [2023-10-12 17:38:35,508 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][4], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][10], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][16], 7:4A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][40], 36:5A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][88], 78:6A:[101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos][196], 236:7A:[110] L33-->L39: Formula: (and (not v_d2_16) v_v_assert_37) InVars {d2=v_d2_16, v_assert=v_v_assert_37} OutVars{d2=v_d2_16, v_assert=v_v_assert_37} AuxVars[] AssignedVars[][357]][430:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][360], 431:9A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][594]] [2023-10-12 17:38:35,509 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][4], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][10], 3:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][16], 7:4A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][40], 40:5A:[101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos][100], 102:6A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][225], 254:7A:[101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos][398]][438:8A:[110] L33-->L39: Formula: (and (not v_d2_16) v_v_assert_37) InVars {d2=v_d2_16, v_assert=v_v_assert_37} OutVars{d2=v_d2_16, v_assert=v_v_assert_37} AuxVars[] AssignedVars[][215], 440:9A:[102] L39-->L33: Formula: (and (= (+ 2 v_pos_23) v_pos_24) (or (and (not v_d2_11) v_d2_10) (and (not v_d2_10) v_d2_11))) InVars {d2=v_d2_11, pos=v_pos_24} OutVars{d2=v_d2_10, pos=v_pos_23} AuxVars[] AssignedVars[d2, pos][377]] [2023-10-12 17:38:35,509 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:35,509 INFO L124 PetriNetUnfolderBase]: 296/439 cut-off events. [2023-10-12 17:38:35,509 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2023-10-12 17:38:35,509 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:35,510 INFO L748 eck$LassoCheckResult]: Stem: 41#[$Ultimate##0]true [64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[] 43#[L56]true [96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0] 45#[L17, L56-1]true [90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 89#[L33, L17, L57]true [109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[] 175#[L17, L35, L57]true [101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos] 89#[L33, L17, L57]true [109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[] 175#[L17, L35, L57]true [101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos] 89#[L33, L17, L57]true [2023-10-12 17:38:35,510 INFO L750 eck$LassoCheckResult]: Loop: 89#[L33, L17, L57]true [110] L33-->L39: Formula: (and (not v_d2_16) v_v_assert_37) InVars {d2=v_d2_16, v_assert=v_v_assert_37} OutVars{d2=v_d2_16, v_assert=v_v_assert_37} AuxVars[] AssignedVars[] 92#[L39, L17, L57]true [102] L39-->L33: Formula: (and (= (+ 2 v_pos_23) v_pos_24) (or (and (not v_d2_11) v_d2_10) (and (not v_d2_10) v_d2_11))) InVars {d2=v_d2_11, pos=v_pos_24} OutVars{d2=v_d2_10, pos=v_pos_23} AuxVars[] AssignedVars[d2, pos] 89#[L33, L17, L57]true [2023-10-12 17:38:35,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:35,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1248366921, now seen corresponding path program 2 times [2023-10-12 17:38:35,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:35,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207554764] [2023-10-12 17:38:35,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:35,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:38:35,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:35,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207554764] [2023-10-12 17:38:35,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207554764] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:38:35,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678620159] [2023-10-12 17:38:35,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:38:35,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:38:35,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:35,536 INFO L229 MonitoredProcess]: Starting monitored process 31 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:35,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-10-12 17:38:35,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:38:35,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:38:35,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:38:35,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:38:35,569 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:38:35,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678620159] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:35,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:38:35,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 4 [2023-10-12 17:38:35,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234009626] [2023-10-12 17:38:35,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:35,570 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:38:35,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:35,570 INFO L85 PathProgramCache]: Analyzing trace with hash 4473, now seen corresponding path program 3 times [2023-10-12 17:38:35,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:35,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836261887] [2023-10-12 17:38:35,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:35,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:35,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:35,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:35,608 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:35,608 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:35,609 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:35,609 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:35,609 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:38:35,609 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:35,609 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:35,609 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:35,609 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_BEv2_Iteration5_Loop [2023-10-12 17:38:35,609 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:35,609 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:35,610 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:35,614 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:35,615 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:35,634 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:35,634 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:38:35,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:35,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:35,637 INFO L229 MonitoredProcess]: Starting monitored process 32 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:35,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-10-12 17:38:35,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:38:35,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:35,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:35,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:35,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:35,681 INFO L229 MonitoredProcess]: Starting monitored process 33 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:35,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-10-12 17:38:35,684 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:38:35,684 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:38:35,712 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:38:35,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:35,737 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:35,737 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:35,737 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:35,737 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:35,737 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:35,737 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:35,737 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:35,737 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:35,737 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_BEv2_Iteration5_Loop [2023-10-12 17:38:35,737 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:35,737 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:35,738 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:35,741 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:35,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:35,762 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:35,762 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:35,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:35,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:35,763 INFO L229 MonitoredProcess]: Starting monitored process 34 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:35,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-10-12 17:38:35,794 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:35,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:35,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:38:35,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:35,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:35,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:35,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:38:35,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:38:35,811 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:35,812 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:38:35,812 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:38:35,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:35,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:35,814 INFO L229 MonitoredProcess]: Starting monitored process 35 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:35,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-10-12 17:38:35,817 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:35,817 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:38:35,817 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:35,817 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d2 1 0)_6) = -2*v_rep(ite d2 1 0)_6 + 1 Supporting invariants [] [2023-10-12 17:38:35,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:35,824 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:35,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:35,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:35,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:35,850 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:35,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:35,859 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:35,859 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:35,984 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:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2023-10-12 17:38:35,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:38:35,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:35,986 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:38:35,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:36,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:36,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:36,011 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:36,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:36,019 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:36,019 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:38:36,157 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:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2023-10-12 17:38:36,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:38:36,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:36,159 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:38:36,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:36,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:36,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:36,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:36,189 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:36,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:36,196 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:36,197 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:38:36,197 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:36,304 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 621 transitions. [2023-10-12 17:38:36,305 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:38:36,747 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:38:36,747 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:36,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2023-10-12 17:38:36,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:38:36,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:36,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:38:36,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:36,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:38:36,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:36,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:36,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:38:36,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:38:36,750 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 73 places, 51300 transitions, 860112 flow. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:36,750 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:36,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:39:32,424 INFO L124 PetriNetUnfolderBase]: 5613/8228 cut-off events. [2023-10-12 17:39:32,424 INFO L125 PetriNetUnfolderBase]: For 1503/1503 co-relation queries the response was YES. [2023-10-12 17:39:32,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76092 conditions, 8228 events. 5613/8228 cut-off events. For 1503/1503 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 42189 event pairs, 0 based on Foata normal form. 0/5006 useless extension candidates. Maximal degree in co-relation 64064. Up to 7682 conditions per place. [2023-10-12 17:39:32,487 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 1915 selfloop transitions, 81 changer transitions 450/2446 dead transitions. [2023-10-12 17:39:32,487 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 61 places, 2446 transitions, 45927 flow [2023-10-12 17:39:32,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:39:32,488 INFO L430 stractBuchiCegarLoop]: Abstraction has has 61 places, 2446 transitions, 45927 flow [2023-10-12 17:39:32,488 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:39:32,488 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 61 places, 2446 transitions, 45927 flow [2023-10-12 17:39:32,493 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3]][7:4A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][6], 8:5A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][18]] [2023-10-12 17:39:32,513 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3], 9:4A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][7], 39:5A:[93] L57-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2][20]][104:6A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][52], 108:7A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][100]] [2023-10-12 17:39:32,514 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3], 9:4A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][7], 47:5A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][22]][111:6A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][52], 112:7A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][100]] [2023-10-12 17:39:32,515 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3], 9:4A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][7], 49:5A:[108] L33-->thread2EXIT: Formula: (not v_v_assert_30) InVars {v_assert=v_v_assert_30} OutVars{v_assert=v_v_assert_30} AuxVars[] AssignedVars[][23]][118:6A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][52], 119:7A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][100]] [2023-10-12 17:39:32,540 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3], 9:4A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][7], 39:5A:[93] L57-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2][20], 99:6A:[111] $Ultimate##0-->thread3EXIT: Formula: (or (and v_v_assert_42 (<= 0 v_pos_77)) (and (not v_v_assert_42) (< v_pos_77 0))) InVars {pos=v_pos_77} OutVars{pos=v_pos_77, v_assert=v_v_assert_42} AuxVars[] AssignedVars[v_assert][49]][233:7A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][27], 234:8A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][54]] [2023-10-12 17:39:32,540 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3], 9:4A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][7], 39:5A:[93] L57-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2][20], 100:6A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][50]][239:7A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][27], 240:8A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][54]] [2023-10-12 17:39:32,541 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3], 9:4A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][7], 39:5A:[93] L57-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2][20], 102:6A:[108] L33-->thread2EXIT: Formula: (not v_v_assert_30) InVars {v_assert=v_v_assert_30} OutVars{v_assert=v_v_assert_30} AuxVars[] AssignedVars[][51]][245:7A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][27], 246:8A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][54]] [2023-10-12 17:39:32,559 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 5:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][4], 19:4A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][10], 54:5A:[101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos][33], 149:6A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][68]][335:7A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][140], 338:8A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][245]] [2023-10-12 17:39:32,594 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3], 9:4A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][7], 39:5A:[93] L57-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2][20], 99:6A:[111] $Ultimate##0-->thread3EXIT: Formula: (or (and v_v_assert_42 (<= 0 v_pos_77)) (and (not v_v_assert_42) (< v_pos_77 0))) InVars {pos=v_pos_77} OutVars{pos=v_pos_77, v_assert=v_v_assert_42} AuxVars[] AssignedVars[v_assert][49], 250:7A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][28]][513:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][52], 514:9A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][100]] [2023-10-12 17:39:32,595 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3], 9:4A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][7], 39:5A:[93] L57-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2][20], 99:6A:[111] $Ultimate##0-->thread3EXIT: Formula: (or (and v_v_assert_42 (<= 0 v_pos_77)) (and (not v_v_assert_42) (< v_pos_77 0))) InVars {pos=v_pos_77} OutVars{pos=v_pos_77, v_assert=v_v_assert_42} AuxVars[] AssignedVars[v_assert][49], 251:7A:[108] L33-->thread2EXIT: Formula: (not v_v_assert_30) InVars {v_assert=v_v_assert_30} OutVars{v_assert=v_v_assert_30} AuxVars[] AssignedVars[][29]][519:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][52], 520:9A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][100]] [2023-10-12 17:39:32,601 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3], 9:4A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][7], 47:5A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][22], 117:6A:[101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos][60], 253:7A:[108] L33-->thread2EXIT: Formula: (not v_v_assert_30) InVars {v_assert=v_v_assert_30} OutVars{v_assert=v_v_assert_30} AuxVars[] AssignedVars[][107]][550:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][134], 552:9A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][212]] [2023-10-12 17:39:32,603 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3], 9:4A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][7], 47:5A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][22], 117:6A:[101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos][60], 255:7A:[108] L33-->thread2EXIT: Formula: (not v_v_assert_30) InVars {v_assert=v_v_assert_30} OutVars{v_assert=v_v_assert_30} AuxVars[] AssignedVars[][108]][557:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][140], 560:9A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][245]] [2023-10-12 17:39:32,604 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3], 9:4A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][7], 47:5A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][22], 117:6A:[101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos][60], 256:7A:[110] L33-->L39: Formula: (and (not v_d2_16) v_v_assert_37) InVars {d2=v_d2_16, v_assert=v_v_assert_37} OutVars{d2=v_d2_16, v_assert=v_v_assert_37} AuxVars[] AssignedVars[][109]][562:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][204], 565:9A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][351]] [2023-10-12 17:39:32,605 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3], 9:4A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][7], 47:5A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][22], 117:6A:[101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos][60], 258:7A:[110] L33-->L39: Formula: (and (not v_d2_16) v_v_assert_37) InVars {d2=v_d2_16, v_assert=v_v_assert_37} OutVars{d2=v_d2_16, v_assert=v_v_assert_37} AuxVars[] AssignedVars[][110]][569:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][207], 572:9A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][365]] [2023-10-12 17:39:32,607 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3], 9:4A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][7], 47:5A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][22], 117:6A:[101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos][60], 264:7A:[93] L57-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2][112]][576:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][140], 579:9A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][245]] [2023-10-12 17:39:32,617 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 5:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][4], 19:4A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][10], 54:5A:[101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos][33], 149:6A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][68], 331:7A:[108] L33-->thread2EXIT: Formula: (not v_v_assert_30) InVars {v_assert=v_v_assert_30} OutVars{v_assert=v_v_assert_30} AuxVars[] AssignedVars[][138]][641:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][228], 643:9A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][219]] [2023-10-12 17:39:32,618 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 5:3A:[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0][4], 19:4A:[109] L33-->L35: Formula: (and v_d2_14 v_v_assert_35) InVars {d2=v_d2_14, v_assert=v_v_assert_35} OutVars{d2=v_d2_14, v_assert=v_v_assert_35} AuxVars[] AssignedVars[][10], 54:5A:[101] L35-->L33: Formula: (and (or (and v_d2_7 (not v_d2_6)) (and (not v_d2_7) v_d2_6)) (= (+ 2 v_pos_16) v_pos_15)) InVars {d2=v_d2_7, pos=v_pos_16} OutVars{d2=v_d2_6, pos=v_pos_15} AuxVars[] AssignedVars[d2, pos][33], 149:6A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][68], 333:7A:[110] L33-->L39: Formula: (and (not v_d2_16) v_v_assert_37) InVars {d2=v_d2_16, v_assert=v_v_assert_37} OutVars{d2=v_d2_16, v_assert=v_v_assert_37} AuxVars[] AssignedVars[][139]][646:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][241], 648:9A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][385]] [2023-10-12 17:39:32,682 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][0], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][1], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][3], 7:4A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][6], 37:5A:[105] L17-->L23: Formula: (and (not v_d1_8) v_v_assert_21) InVars {d1=v_d1_8, v_assert=v_v_assert_21} OutVars{d1=v_d1_8, v_assert=v_v_assert_21} AuxVars[] AssignedVars[][17], 94:6A:[106] L23-->L17: Formula: (and (= (+ v_pos_47 1) v_pos_48) (or (and (not v_d1_10) v_d1_11) (and (not v_d1_11) v_d1_10))) InVars {d1=v_d1_11, pos=v_pos_48} OutVars{d1=v_d1_10, pos=v_pos_47} AuxVars[] AssignedVars[d1, pos][48], 222:7A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][93], 498:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][183]][927:9A:[105] L17-->L23: Formula: (and (not v_d1_8) v_v_assert_21) InVars {d1=v_d1_8, v_assert=v_v_assert_21} OutVars{d1=v_d1_8, v_assert=v_v_assert_21} AuxVars[] AssignedVars[][333], 928:10A:[106] L23-->L17: Formula: (and (= (+ v_pos_47 1) v_pos_48) (or (and (not v_d1_10) v_d1_11) (and (not v_d1_11) v_d1_10))) InVars {d1=v_d1_11, pos=v_pos_48} OutVars{d1=v_d1_10, pos=v_pos_47} AuxVars[] AssignedVars[d1, pos][516]] [2023-10-12 17:39:32,682 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:32,682 INFO L124 PetriNetUnfolderBase]: 625/927 cut-off events. [2023-10-12 17:39:32,682 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2023-10-12 17:39:32,683 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:32,683 INFO L748 eck$LassoCheckResult]: Stem: 41#[$Ultimate##0]true [64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[] 43#[L56]true [96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0] 45#[L17, L56-1]true [104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[] 48#[L56-1, L19]true [107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos] 45#[L17, L56-1]true [105] L17-->L23: Formula: (and (not v_d1_8) v_v_assert_21) InVars {d1=v_d1_8, v_assert=v_v_assert_21} OutVars{d1=v_d1_8, v_assert=v_v_assert_21} AuxVars[] AssignedVars[] 131#[L23, L56-1]true [106] L23-->L17: Formula: (and (= (+ v_pos_47 1) v_pos_48) (or (and (not v_d1_10) v_d1_11) (and (not v_d1_11) v_d1_10))) InVars {d1=v_d1_11, pos=v_pos_48} OutVars{d1=v_d1_10, pos=v_pos_47} AuxVars[] AssignedVars[d1, pos] 45#[L17, L56-1]true [104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[] 48#[L56-1, L19]true [107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos] 45#[L17, L56-1]true [2023-10-12 17:39:32,683 INFO L750 eck$LassoCheckResult]: Loop: 45#[L17, L56-1]true [105] L17-->L23: Formula: (and (not v_d1_8) v_v_assert_21) InVars {d1=v_d1_8, v_assert=v_v_assert_21} OutVars{d1=v_d1_8, v_assert=v_v_assert_21} AuxVars[] AssignedVars[] 131#[L23, L56-1]true [106] L23-->L17: Formula: (and (= (+ v_pos_47 1) v_pos_48) (or (and (not v_d1_10) v_d1_11) (and (not v_d1_11) v_d1_10))) InVars {d1=v_d1_11, pos=v_pos_48} OutVars{d1=v_d1_10, pos=v_pos_47} AuxVars[] AssignedVars[d1, pos] 45#[L17, L56-1]true [2023-10-12 17:39:32,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:32,683 INFO L85 PathProgramCache]: Analyzing trace with hash 443746440, now seen corresponding path program 1 times [2023-10-12 17:39:32,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:32,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804314021] [2023-10-12 17:39:32,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:32,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:32,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:32,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:32,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:32,690 INFO L85 PathProgramCache]: Analyzing trace with hash 4322, now seen corresponding path program 2 times [2023-10-12 17:39:32,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:32,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184057027] [2023-10-12 17:39:32,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:32,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:32,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:32,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:32,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:32,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1238569897, now seen corresponding path program 2 times [2023-10-12 17:39:32,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:32,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867799582] [2023-10-12 17:39:32,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:32,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:32,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:32,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:32,719 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:32,719 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:32,719 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:32,719 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:32,719 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:39:32,719 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:32,719 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:32,719 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:32,719 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_BEv2_Iteration6_Loop [2023-10-12 17:39:32,719 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:32,719 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:32,720 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:39:32,721 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:39:32,724 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:39:32,739 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:32,739 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:39:32,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:32,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:32,740 INFO L229 MonitoredProcess]: Starting monitored process 36 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:39:32,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-10-12 17:39:32,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:39:32,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:39:32,768 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:39:32,768 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite v_assert 1 0)_11=1} Honda state: {v_rep(ite v_assert 1 0)_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:39:32,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2023-10-12 17:39:32,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:32,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:32,772 INFO L229 MonitoredProcess]: Starting monitored process 37 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:39:32,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-10-12 17:39:32,775 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:39:32,775 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:39:32,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2023-10-12 17:39:32,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:32,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:32,784 INFO L229 MonitoredProcess]: Starting monitored process 38 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:39:32,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-10-12 17:39:32,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:39:32,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:39:32,801 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:39:32,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-10-12 17:39:32,804 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:32,804 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:32,804 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:32,804 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:32,804 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:32,804 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:32,804 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:32,804 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:32,804 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_BEv2_Iteration6_Loop [2023-10-12 17:39:32,804 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:32,804 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:32,805 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:39:32,807 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:39:32,810 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:39:32,830 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:32,830 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:32,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:32,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:32,831 INFO L229 MonitoredProcess]: Starting monitored process 39 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:39:32,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-10-12 17:39:32,835 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:39:32,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:32,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:39:32,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:32,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:32,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:32,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:39:32,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:39:32,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:32,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2023-10-12 17:39:32,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:32,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:32,853 INFO L229 MonitoredProcess]: Starting monitored process 40 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:39:32,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-10-12 17:39:32,857 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:39:32,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:32,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:39:32,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:32,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:32,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:32,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:39:32,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:39:32,880 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:32,882 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:39:32,882 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:39:32,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:32,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:32,883 INFO L229 MonitoredProcess]: Starting monitored process 41 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:39:32,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-10-12 17:39:32,886 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:32,886 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:39:32,886 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:32,886 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d1 1 0)_6) = -2*v_rep(ite d1 1 0)_6 + 1 Supporting invariants [] [2023-10-12 17:39:32,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-10-12 17:39:32,889 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:39:32,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:32,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:32,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:32,913 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:32,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:32,920 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:39:32,920 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:39:33,073 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:39:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:39:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2023-10-12 17:39:33,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:39:33,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:33,074 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:39:33,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:33,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:33,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:33,095 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:33,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:33,104 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:39:33,105 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:39:33,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2023-10-12 17:39:33,300 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:39:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:39:33,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2023-10-12 17:39:33,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:39:33,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:33,301 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:39:33,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:33,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:33,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:33,328 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:33,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:33,342 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:39:33,343 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:39:33,343 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:39:33,418 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 621 transitions. [2023-10-12 17:39:33,419 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:39:33,959 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:39:33,960 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:39:33,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:39:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2023-10-12 17:39:33,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:39:33,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:33,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:39:33,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:33,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:39:33,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:33,961 INFO L430 stractBuchiCegarLoop]: Abstraction has has 85 places, 66142 transitions, 1376012 flow [2023-10-12 17:39:33,961 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:39:33,961 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 85 places, 66142 transitions, 1376012 flow [2023-10-12 17:40:00,538 ERROR L47 etriNetUnfolderRabin]: [1:1A:[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[][18], 2:2A:[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0][47], 4:3A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][100], 7:4A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][179], 36:5A:[105] L17-->L23: Formula: (and (not v_d1_8) v_v_assert_21) InVars {d1=v_d1_8, v_assert=v_v_assert_21} OutVars{d1=v_d1_8, v_assert=v_v_assert_21} AuxVars[] AssignedVars[][486], 126:6A:[106] L23-->L17: Formula: (and (= (+ v_pos_47 1) v_pos_48) (or (and (not v_d1_10) v_d1_11) (and (not v_d1_11) v_d1_10))) InVars {d1=v_d1_11, pos=v_pos_48} OutVars{d1=v_d1_10, pos=v_pos_47} AuxVars[] AssignedVars[d1, pos][1311], 331:7A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][2551], 810:8A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][4983]][1683:9A:[104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[][9090], 1684:10A:[107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos][14059]] [2023-10-12 17:40:00,538 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:00,538 INFO L124 PetriNetUnfolderBase]: 1153/1683 cut-off events. [2023-10-12 17:40:00,538 INFO L125 PetriNetUnfolderBase]: For 355/355 co-relation queries the response was YES. [2023-10-12 17:40:00,538 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:00,539 INFO L748 eck$LassoCheckResult]: Stem: 41#[$Ultimate##0]true [64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[] 43#[L56]true [96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0] 45#[L17, L56-1]true [104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[] 48#[L56-1, L19]true [107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos] 45#[L17, L56-1]true [105] L17-->L23: Formula: (and (not v_d1_8) v_v_assert_21) InVars {d1=v_d1_8, v_assert=v_v_assert_21} OutVars{d1=v_d1_8, v_assert=v_v_assert_21} AuxVars[] AssignedVars[] 131#[L23, L56-1]true [106] L23-->L17: Formula: (and (= (+ v_pos_47 1) v_pos_48) (or (and (not v_d1_10) v_d1_11) (and (not v_d1_11) v_d1_10))) InVars {d1=v_d1_11, pos=v_pos_48} OutVars{d1=v_d1_10, pos=v_pos_47} AuxVars[] AssignedVars[d1, pos] 45#[L17, L56-1]true [104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[] 48#[L56-1, L19]true [107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos] 45#[L17, L56-1]true [2023-10-12 17:40:00,539 INFO L750 eck$LassoCheckResult]: Loop: 45#[L17, L56-1]true [104] L17-->L19: Formula: (and v_d1_6 v_v_assert_19) InVars {d1=v_d1_6, v_assert=v_v_assert_19} OutVars{d1=v_d1_6, v_assert=v_v_assert_19} AuxVars[] AssignedVars[] 48#[L56-1, L19]true [107] L19-->L17: Formula: (and (or (and v_d1_14 (not v_d1_15)) (and (not v_d1_14) v_d1_15)) (= (+ v_pos_68 1) v_pos_67)) InVars {d1=v_d1_15, pos=v_pos_68} OutVars{d1=v_d1_14, pos=v_pos_67} AuxVars[] AssignedVars[d1, pos] 45#[L17, L56-1]true [2023-10-12 17:40:00,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:00,539 INFO L85 PathProgramCache]: Analyzing trace with hash 443746440, now seen corresponding path program 3 times [2023-10-12 17:40:00,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:00,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623238715] [2023-10-12 17:40:00,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:00,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:00,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:00,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:00,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash 4292, now seen corresponding path program 2 times [2023-10-12 17:40:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803265468] [2023-10-12 17:40:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:00,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:00,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:00,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:00,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1238569867, now seen corresponding path program 4 times [2023-10-12 17:40:00,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:00,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864494337] [2023-10-12 17:40:00,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:00,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-10-12 17:40:00,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:40:00,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864494337] [2023-10-12 17:40:00,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864494337] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:40:00,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:40:00,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-10-12 17:40:00,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903425302] [2023-10-12 17:40:00,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:40:00,607 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:00,607 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:00,608 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:00,608 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:00,608 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:40:00,608 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:00,608 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:00,608 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:00,608 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_BEv2_Iteration7_Loop [2023-10-12 17:40:00,608 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:00,608 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:00,608 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:40:00,610 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:40:00,612 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:40:00,628 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:00,628 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:40:00,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:00,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:00,637 INFO L229 MonitoredProcess]: Starting monitored process 42 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:40:00,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-10-12 17:40:00,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:40:00,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:00,656 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:40:00,656 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite v_assert 1 0)_13=1} Honda state: {v_rep(ite v_assert 1 0)_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:40:00,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2023-10-12 17:40:00,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:00,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:00,660 INFO L229 MonitoredProcess]: Starting monitored process 43 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:40:00,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-10-12 17:40:00,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:40:00,663 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:00,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:00,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:00,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:00,683 INFO L229 MonitoredProcess]: Starting monitored process 44 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:40:00,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-10-12 17:40:00,686 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:40:00,686 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:00,703 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:40:00,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2023-10-12 17:40:00,706 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:00,706 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:00,706 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:00,706 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:00,706 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:00,706 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:00,706 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:00,706 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:00,706 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_BEv2_Iteration7_Loop [2023-10-12 17:40:00,706 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:00,706 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:00,707 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:40:00,709 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:40:00,714 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:40:00,731 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:00,731 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:00,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:00,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:00,732 INFO L229 MonitoredProcess]: Starting monitored process 45 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:40:00,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-10-12 17:40:00,736 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:40:00,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:00,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:40:00,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:00,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:00,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:00,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:40:00,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:40:00,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:00,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2023-10-12 17:40:00,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:00,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:00,761 INFO L229 MonitoredProcess]: Starting monitored process 46 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:40:00,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-10-12 17:40:00,803 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:40:00,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:00,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:40:00,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:00,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:00,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:00,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:40:00,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:40:00,812 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:00,813 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:40:00,813 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:40:00,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:00,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:00,814 INFO L229 MonitoredProcess]: Starting monitored process 47 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:40:00,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-10-12 17:40:00,825 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:00,825 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:40:00,825 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:00,825 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d1 1 0)_8) = 1*v_rep(ite d1 1 0)_8 Supporting invariants [] [2023-10-12 17:40:00,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2023-10-12 17:40:00,829 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:00,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:00,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:00,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:00,855 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:00,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:00,867 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:40:00,867 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:40:01,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2023-10-12 17:40:05,177 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:40:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:40:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2023-10-12 17:40:05,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:40:05,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:05,207 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:40:05,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:05,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:05,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:05,259 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:05,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:05,266 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:40:05,267 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:40:09,178 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:40:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:40:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2023-10-12 17:40:09,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 224 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:40:09,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:09,179 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:40:09,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:09,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:09,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:09,220 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:09,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:09,243 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:40:09,244 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:40:09,244 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:40:09,317 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 622 transitions. [2023-10-12 17:40:09,317 INFO L79 BuchiIntersect]: Starting Intersection