/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-proofs/counter-add-4-semi-Q67.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:40:56,306 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:40:56,371 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:40:56,405 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:40:56,405 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:40:56,406 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:40:56,407 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:40:56,407 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:40:56,407 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:40:56,408 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:40:56,408 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:40:56,408 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:40:56,409 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:40:56,409 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:40:56,409 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:40:56,410 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:40:56,410 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:40:56,410 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:40:56,415 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:40:56,415 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:40:56,415 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:40:56,420 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:40:56,420 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:40:56,420 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:40:56,421 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:40:56,421 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:40:56,421 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:40:56,421 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:40:56,421 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:40:56,421 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:40:56,422 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:40:56,422 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:40:56,422 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:40:56,423 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:40:56,423 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:40:56,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:40:56,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:40:56,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:40:56,643 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:40:56,644 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:40:56,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-proofs/counter-add-4-semi-Q67.wvr.bpl [2023-10-12 17:40:56,645 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-proofs/counter-add-4-semi-Q67.wvr.bpl' [2023-10-12 17:40:56,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:40:56,681 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:40:56,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:56,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:40:56,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:40:56,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:56" (1/1) ... [2023-10-12 17:40:56,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:56" (1/1) ... [2023-10-12 17:40:56,706 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:40:56,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:56,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:40:56,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:40:56,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:40:56,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:56" (1/1) ... [2023-10-12 17:40:56,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:56" (1/1) ... [2023-10-12 17:40:56,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:56" (1/1) ... [2023-10-12 17:40:56,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:56" (1/1) ... [2023-10-12 17:40:56,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:56" (1/1) ... [2023-10-12 17:40:56,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:56" (1/1) ... [2023-10-12 17:40:56,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:56" (1/1) ... [2023-10-12 17:40:56,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:56" (1/1) ... [2023-10-12 17:40:56,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:40:56,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:40:56,735 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:40:56,735 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:40:56,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:56" (1/1) ... [2023-10-12 17:40:56,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:56,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:56,780 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:40:56,800 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:40:56,823 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:40:56,824 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:40:56,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:40:56,824 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:40:56,824 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:40:56,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:40:56,824 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:40:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:40:56,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:40:56,825 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:40:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:40:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:40:56,826 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-10-12 17:40:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-10-12 17:40:56,827 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-10-12 17:40:56,827 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:40:56,870 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:40:56,871 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:40:56,963 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:40:56,983 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:40:56,984 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:40:56,985 INFO L201 PluginConnector]: Adding new model counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:56 BoogieIcfgContainer [2023-10-12 17:40:56,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:40:56,986 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:40:56,986 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:40:56,990 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:40:56,990 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:56,991 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:56" (1/2) ... [2023-10-12 17:40:56,992 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@462f648a and model type counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:40:56, skipping insertion in model container [2023-10-12 17:40:56,992 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:56,992 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:56" (2/2) ... [2023-10-12 17:40:56,993 INFO L332 chiAutomizerObserver]: Analyzing ICFG counter-add-4-semi-Q67.wvr.bpl [2023-10-12 17:40:57,057 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:40:57,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:40:57,146 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:40:57,146 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:40:57,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-10-12 17:40:57,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:40:57,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2023-10-12 17:40:57,158 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:40:57,172 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:40:57,174 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:40:57,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 86 flow [2023-10-12 17:40:57,184 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:40:57,185 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:40:57,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-10-12 17:40:57,186 INFO L119 LiptonReduction]: Number of co-enabled transitions 288 [2023-10-12 17:40:57,502 INFO L134 LiptonReduction]: Checked pairs total: 192 [2023-10-12 17:40:57,503 INFO L136 LiptonReduction]: Total number of compositions: 13 [2023-10-12 17:40:57,516 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:40:57,516 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:40:57,516 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:40:57,516 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:40:57,516 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:40:57,517 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:40:57,517 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:40:57,517 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:40:57,518 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 28 places, 19 transitions, 62 flow [2023-10-12 17:40:57,521 ERROR L47 etriNetUnfolderRabin]: [1:1A:[130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[][17], 2:2A:[104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][2]][3:3A:[124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][14]] [2023-10-12 17:40:57,524 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:57,524 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:57,524 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:57,524 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:57,528 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:40:57,529 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 28 places, 19 transitions, 62 flow [2023-10-12 17:40:57,530 ERROR L47 etriNetUnfolderRabin]: [1:1A:[130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[][17], 2:2A:[104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][2]][3:3A:[124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][14]] [2023-10-12 17:40:57,530 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:57,530 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:57,530 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:57,530 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:57,534 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 50#[L71]true [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L23-1, L71-1]true [2023-10-12 17:40:57,534 INFO L750 eck$LassoCheckResult]: Loop: 52#[L23-1, L71-1]true [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 52#[L23-1, L71-1]true [2023-10-12 17:40:57,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:57,538 INFO L85 PathProgramCache]: Analyzing trace with hash 5095, now seen corresponding path program 1 times [2023-10-12 17:40:57,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:57,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364512374] [2023-10-12 17:40:57,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:57,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:57,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:57,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:57,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:57,636 INFO L85 PathProgramCache]: Analyzing trace with hash 155, now seen corresponding path program 1 times [2023-10-12 17:40:57,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:57,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515393344] [2023-10-12 17:40:57,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:57,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:57,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:57,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:57,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:57,665 INFO L85 PathProgramCache]: Analyzing trace with hash 158069, now seen corresponding path program 1 times [2023-10-12 17:40:57,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:57,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035457454] [2023-10-12 17:40:57,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:57,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:57,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:57,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:57,746 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:57,748 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:57,748 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:57,748 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:57,748 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:40:57,748 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:57,748 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:57,748 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:57,749 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:40:57,749 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:57,749 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:57,765 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:57,779 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:57,817 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:57,818 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:40:57,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:57,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:57,831 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:40:57,832 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:40:57,834 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:40:57,835 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:57,862 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:40:57,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:57,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:57,864 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:40:57,865 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:40:57,867 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:40:57,867 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:57,992 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:40:57,996 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:40:57,996 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:57,996 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:57,997 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:57,997 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:57,997 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:57,997 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:57,997 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:57,997 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:57,997 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:40:57,997 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:57,998 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:57,999 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:58,008 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:58,041 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:58,044 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:58,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:58,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:58,047 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:40:58,048 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:40:58,050 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:58,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:58,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:40:58,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:58,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:58,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:58,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:40:58,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:40:58,065 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:58,069 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:40:58,069 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:40:58,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:58,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:58,098 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:40:58,100 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:40:58,101 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:58,101 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:40:58,102 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:58,102 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N1) = -1*i1 + 1*N1 Supporting invariants [] [2023-10-12 17:40:58,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:58,112 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:58,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:58,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:58,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:58,170 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:58,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:58,171 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:58,200 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:40:58,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:40:58,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2023-10-12 17:40:58,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:40:58,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:58,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:58,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:58,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:40:58,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:58,301 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 76 transitions, 400 flow [2023-10-12 17:40:58,301 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:40:58,302 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 76 transitions, 400 flow [2023-10-12 17:40:58,303 ERROR L47 etriNetUnfolderRabin]: [1:1A:[130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[][70], 2:2A:[104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][10], 4:3A:[107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][21]][5:4A:[121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2][55]] [2023-10-12 17:40:58,304 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:58,304 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:40:58,304 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:58,304 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:58,304 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 50#[L71]true [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L23-1, L71-1]true [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 87#[L23-1, L34-1, L72]true [2023-10-12 17:40:58,305 INFO L750 eck$LassoCheckResult]: Loop: 87#[L23-1, L34-1, L72]true [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 87#[L23-1, L34-1, L72]true [2023-10-12 17:40:58,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:58,305 INFO L85 PathProgramCache]: Analyzing trace with hash 158052, now seen corresponding path program 1 times [2023-10-12 17:40:58,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:58,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523884364] [2023-10-12 17:40:58,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:58,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:58,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:58,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:58,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 1 times [2023-10-12 17:40:58,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:58,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402620271] [2023-10-12 17:40:58,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:58,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:58,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:58,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:58,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:58,340 INFO L85 PathProgramCache]: Analyzing trace with hash 4899733, now seen corresponding path program 1 times [2023-10-12 17:40:58,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:58,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801411626] [2023-10-12 17:40:58,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:58,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:58,398 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:58,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:40:58,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801411626] [2023-10-12 17:40:58,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801411626] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:40:58,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:40:58,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:40:58,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252749078] [2023-10-12 17:40:58,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:40:58,427 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:58,427 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:58,427 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:58,427 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:58,428 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:40:58,428 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:58,428 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:58,428 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:58,428 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:40:58,428 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:58,428 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:58,429 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:58,434 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:58,472 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:58,472 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:40:58,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:58,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:58,477 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:40:58,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:40:58,486 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:58,496 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:40:58,507 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:40:58,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:58,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:58,509 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:40:58,513 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:40:58,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:40:58,514 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:58,541 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:40:58,551 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:40:58,551 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:58,551 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:58,551 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:58,552 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:58,552 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:58,552 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:58,552 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:58,552 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:58,552 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:40:58,552 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:58,552 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:58,553 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:58,561 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:58,590 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:58,590 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:58,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:58,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:58,592 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:40:58,594 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:40:58,596 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:58,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:58,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:40:58,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:58,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:58,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:58,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:40:58,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:40:58,618 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:58,621 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:40:58,622 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:40:58,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:58,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:58,629 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:40:58,633 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:58,633 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:40:58,633 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:58,633 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:40:58,636 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:40:58,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:58,642 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:58,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:58,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:58,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:58,675 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:58,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:58,676 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:58,676 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:40:58,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:58,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:40:58,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:40:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) 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:40:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2023-10-12 17:40:58,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:58,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:58,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:40:58,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:58,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:40:58,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:58,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:40:58,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:40:58,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:40:58,804 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 37 places, 380 transitions, 2760 flow. Second operand has 3 states, 2 states have (on average 2.0) 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:40:58,804 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:40:58,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:40:58,923 INFO L124 PetriNetUnfolderBase]: 461/639 cut-off events. [2023-10-12 17:40:58,923 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2023-10-12 17:40:58,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2724 conditions, 639 events. 461/639 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1810 event pairs, 42 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 1940. Up to 571 conditions per place. [2023-10-12 17:40:58,933 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 75 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2023-10-12 17:40:58,934 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 36 places, 80 transitions, 733 flow [2023-10-12 17:40:58,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:40:58,935 INFO L430 stractBuchiCegarLoop]: Abstraction has has 36 places, 80 transitions, 733 flow [2023-10-12 17:40:58,935 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:40:58,935 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 36 places, 80 transitions, 733 flow [2023-10-12 17:40:58,942 ERROR L47 etriNetUnfolderRabin]: [1:1A:[130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[][0], 2:2A:[104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 6:3A:[107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][4], 14:4A:[110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][10], 55:5A:[119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1][24]][56:6A:[119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1][43]] [2023-10-12 17:40:58,942 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:58,943 INFO L124 PetriNetUnfolderBase]: 32/55 cut-off events. [2023-10-12 17:40:58,943 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:40:58,943 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:58,943 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 50#[L71]true [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L23-1, L71-1]true [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 87#[L23-1, L34-1, L72]true [110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 123#[L46-1, L23-1, L34-1, L73]true [119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1] 123#[L46-1, L23-1, L34-1, L73]true [2023-10-12 17:40:58,943 INFO L750 eck$LassoCheckResult]: Loop: 123#[L46-1, L23-1, L34-1, L73]true [119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1] 123#[L46-1, L23-1, L34-1, L73]true [2023-10-12 17:40:58,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash 151891501, now seen corresponding path program 1 times [2023-10-12 17:40:58,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:58,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594326755] [2023-10-12 17:40:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:58,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:58,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:58,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:58,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:58,958 INFO L85 PathProgramCache]: Analyzing trace with hash 150, now seen corresponding path program 1 times [2023-10-12 17:40:58,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:58,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258153910] [2023-10-12 17:40:58,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:58,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:58,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:58,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:58,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:58,965 INFO L85 PathProgramCache]: Analyzing trace with hash 413669354, now seen corresponding path program 2 times [2023-10-12 17:40:58,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:58,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225292124] [2023-10-12 17:40:58,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:58,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:58,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:58,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:58,993 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:58,994 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:58,994 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:58,994 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:58,994 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:40:58,994 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:58,994 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:58,994 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:58,994 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:40:58,994 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:58,994 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:58,995 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:58,998 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:59,018 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:59,019 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:40:59,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:59,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:59,020 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:40:59,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:40:59,030 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:59,040 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:40:59,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:40:59,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:59,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:59,058 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:40:59,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:40:59,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:59,072 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:40:59,102 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:40:59,102 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter=0} Honda state: {counter=0} Generalized eigenvectors: [{counter=1}, {counter=-2}, {counter=2}] Lambdas: [1, 2, 1] Nus: [0, 1] [2023-10-12 17:40:59,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:59,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:59,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:59,110 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:40:59,113 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:40:59,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:40:59,114 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:59,130 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:40:59,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:59,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:59,132 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:40:59,133 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:40:59,135 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:40:59,136 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:59,228 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:40:59,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:40:59,232 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:59,232 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:59,232 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:59,232 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:59,232 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:59,233 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:59,233 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:59,233 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:59,233 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:40:59,233 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:59,233 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:59,234 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:59,247 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:59,279 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:59,279 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:59,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:59,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:59,280 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:40:59,299 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:40:59,299 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:59,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:59,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:40:59,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:59,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:59,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:59,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:40:59,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:40:59,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:59,328 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:40:59,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:59,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:59,330 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:40:59,332 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:40:59,334 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:59,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:59,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:40:59,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:59,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:59,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:59,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:40:59,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:40:59,356 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:59,360 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:40:59,360 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:40:59,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:59,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:59,362 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:40:59,365 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:40:59,365 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:59,365 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:40:59,366 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:59,366 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(j1, M1) = -1*j1 + 1*M1 Supporting invariants [] [2023-10-12 17:40:59,372 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:40:59,373 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:59,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:59,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:59,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:59,409 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:59,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:59,410 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:59,411 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:40:59,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:40:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:40:59,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2023-10-12 17:40:59,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:40:59,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:59,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:40:59,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:59,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:40:59,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:59,497 INFO L430 stractBuchiCegarLoop]: Abstraction has has 40 places, 320 transitions, 3572 flow [2023-10-12 17:40:59,498 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:40:59,498 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 40 places, 320 transitions, 3572 flow [2023-10-12 17:40:59,506 ERROR L47 etriNetUnfolderRabin]: [1:1A:[130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[][2], 2:2A:[104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6], 6:3A:[107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][18], 17:4A:[124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][46], 57:5A:[110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][106]][64:6A:[121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2][198]] [2023-10-12 17:40:59,507 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:59,507 INFO L124 PetriNetUnfolderBase]: 38/63 cut-off events. [2023-10-12 17:40:59,507 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-10-12 17:40:59,507 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:59,508 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 50#[L71]true [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L23-1, L71-1]true [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 87#[L23-1, L34-1, L72]true [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 87#[L23-1, L34-1, L72]true [110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 123#[L46-1, L23-1, L34-1, L73]true [2023-10-12 17:40:59,508 INFO L750 eck$LassoCheckResult]: Loop: 123#[L46-1, L23-1, L34-1, L73]true [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 123#[L46-1, L23-1, L34-1, L73]true [2023-10-12 17:40:59,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:59,508 INFO L85 PathProgramCache]: Analyzing trace with hash 151891926, now seen corresponding path program 1 times [2023-10-12 17:40:59,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:59,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27006702] [2023-10-12 17:40:59,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:59,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:59,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:59,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:59,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:59,520 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 2 times [2023-10-12 17:40:59,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:59,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126995185] [2023-10-12 17:40:59,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:59,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:59,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:59,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:59,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:59,526 INFO L85 PathProgramCache]: Analyzing trace with hash 413682531, now seen corresponding path program 1 times [2023-10-12 17:40:59,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:59,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556426984] [2023-10-12 17:40:59,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:59,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:59,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:59,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:59,558 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:59,559 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:59,559 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:59,559 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:59,559 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:40:59,559 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:59,559 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:59,559 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:59,559 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration4_Loop [2023-10-12 17:40:59,559 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:59,559 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:59,560 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:59,565 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:59,587 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:59,587 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:40:59,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:59,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:59,589 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:40:59,599 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:40:59,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:40:59,600 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:59,628 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:40:59,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:59,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:59,630 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:40:59,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:40:59,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:59,653 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:40:59,661 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:40:59,664 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:40:59,664 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:59,664 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:59,664 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:59,664 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:59,664 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:59,665 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:59,665 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:59,665 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:59,665 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration4_Loop [2023-10-12 17:40:59,665 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:59,665 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:59,666 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:59,685 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:59,720 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:59,720 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:59,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:59,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:59,722 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:40:59,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:59,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:59,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:40:59,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:59,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:59,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:59,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:40:59,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:40:59,747 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:40:59,761 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:59,764 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:40:59,764 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:40:59,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:59,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:59,765 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:40:59,775 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:59,775 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:40:59,775 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:59,775 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:40:59,781 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:40:59,781 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:40:59,782 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:59,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:59,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:59,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:59,813 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:59,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:59,814 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:59,814 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:40:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:40:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:40:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2023-10-12 17:40:59,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:40:59,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:59,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:40:59,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:59,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:40:59,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:59,884 INFO L430 stractBuchiCegarLoop]: Abstraction has has 45 places, 1600 transitions, 21060 flow [2023-10-12 17:40:59,884 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:40:59,884 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 45 places, 1600 transitions, 21060 flow [2023-10-12 17:40:59,906 ERROR L47 etriNetUnfolderRabin]: [1:1A:[130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[][14], 2:2A:[104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][34], 6:3A:[107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][94], 15:4A:[124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][234], 69:5A:[121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2][574]][73:6A:[121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2][994]] [2023-10-12 17:40:59,907 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:59,908 INFO L124 PetriNetUnfolderBase]: 43/72 cut-off events. [2023-10-12 17:40:59,908 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:40:59,908 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:59,909 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 50#[L71]true [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L23-1, L71-1]true [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 87#[L23-1, L34-1, L72]true [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 87#[L23-1, L34-1, L72]true [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 87#[L23-1, L34-1, L72]true [2023-10-12 17:40:59,909 INFO L750 eck$LassoCheckResult]: Loop: 87#[L23-1, L34-1, L72]true [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 87#[L23-1, L34-1, L72]true [2023-10-12 17:40:59,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:59,909 INFO L85 PathProgramCache]: Analyzing trace with hash 151891937, now seen corresponding path program 1 times [2023-10-12 17:40:59,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:59,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879440588] [2023-10-12 17:40:59,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:59,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:59,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:59,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:59,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:59,936 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 3 times [2023-10-12 17:40:59,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:59,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798332926] [2023-10-12 17:40:59,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:59,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:59,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:59,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:59,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:59,942 INFO L85 PathProgramCache]: Analyzing trace with hash 413682872, now seen corresponding path program 2 times [2023-10-12 17:40:59,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:59,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728186468] [2023-10-12 17:40:59,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:59,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:40:59,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:40:59,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728186468] [2023-10-12 17:40:59,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728186468] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:40:59,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:40:59,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:40:59,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663093069] [2023-10-12 17:40:59,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:41:00,001 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:00,001 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:00,001 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:00,001 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:00,001 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:00,002 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:00,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:00,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:00,002 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration5_Loop [2023-10-12 17:41:00,002 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:00,002 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:00,003 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:41:00,007 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:41:00,042 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:00,042 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:00,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:00,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:00,043 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:41:00,046 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:41:00,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:00,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:00,076 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:41:00,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:00,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:00,078 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:41:00,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:00,090 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:00,106 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:41:00,118 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:00,124 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:41:00,125 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:00,125 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:00,125 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:00,125 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:00,125 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:00,125 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:00,125 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:00,125 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:00,125 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration5_Loop [2023-10-12 17:41:00,125 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:00,125 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:00,126 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:41:00,131 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:41:00,157 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:00,157 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:00,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:00,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:00,159 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:41:00,162 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:41:00,163 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:41:00,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:00,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:00,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:00,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:00,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:00,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:00,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:00,189 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:00,193 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:41:00,193 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:00,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:00,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:00,199 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:41:00,201 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:00,201 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:00,201 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:00,201 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:41:00,209 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:41:00,209 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:00,212 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:41:00,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:00,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:00,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:00,240 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:00,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:00,241 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:41:00,242 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:41:00,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:41:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2023-10-12 17:41:00,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:41:00,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:00,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:41:00,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:00,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:41:00,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:00,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:41:00,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:41:00,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:41:00,356 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 50 places, 8000 transitions, 121300 flow. Second operand has 4 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:41:00,357 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:41:00,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:41:00,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:00,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:00,572 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:41:04,847 INFO L124 PetriNetUnfolderBase]: 4383/6076 cut-off events. [2023-10-12 17:41:04,848 INFO L125 PetriNetUnfolderBase]: For 1511/1511 co-relation queries the response was YES. [2023-10-12 17:41:04,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49954 conditions, 6076 events. 4383/6076 cut-off events. For 1511/1511 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 28033 event pairs, 273 based on Foata normal form. 0/3792 useless extension candidates. Maximal degree in co-relation 34432. Up to 5969 conditions per place. [2023-10-12 17:41:04,935 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 705 selfloop transitions, 127 changer transitions 0/832 dead transitions. [2023-10-12 17:41:04,935 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 50 places, 832 transitions, 14059 flow [2023-10-12 17:41:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:41:04,937 INFO L430 stractBuchiCegarLoop]: Abstraction has has 50 places, 832 transitions, 14059 flow [2023-10-12 17:41:04,937 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:41:04,937 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 50 places, 832 transitions, 14059 flow [2023-10-12 17:41:04,996 ERROR L47 etriNetUnfolderRabin]: [1:1A:[130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[][0], 2:2A:[104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][3], 7:4A:[107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][6], 27:5A:[110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][17], 111:6A:[119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1][51], 465:7A:[113] L73-->L57-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][138]][468:8A:[127] L57-1-->L57-1: Formula: (and (= v_j2_12 (+ v_j2_13 1)) (< 0 v_counter_52) (< v_j2_13 v_M2_8) (= v_counter_52 (+ v_counter_51 1))) InVars {counter=v_counter_52, j2=v_j2_13, M2=v_M2_8} OutVars{counter=v_counter_51, j2=v_j2_12, M2=v_M2_8} AuxVars[] AssignedVars[counter, j2][334]] [2023-10-12 17:41:04,997 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:04,997 INFO L124 PetriNetUnfolderBase]: 318/467 cut-off events. [2023-10-12 17:41:04,997 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2023-10-12 17:41:04,997 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:04,998 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 50#[L71]true [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L23-1, L71-1]true [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 52#[L23-1, L71-1]true [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 87#[L23-1, L34-1, L72]true [110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 123#[L46-1, L23-1, L34-1, L73]true [119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1] 123#[L46-1, L23-1, L34-1, L73]true [113] L73-->L57-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 251#[L46-1, L23-1, L34-1, L74, L57-1]true [2023-10-12 17:41:04,998 INFO L750 eck$LassoCheckResult]: Loop: 251#[L46-1, L23-1, L34-1, L74, L57-1]true [127] L57-1-->L57-1: Formula: (and (= v_j2_12 (+ v_j2_13 1)) (< 0 v_counter_52) (< v_j2_13 v_M2_8) (= v_counter_52 (+ v_counter_51 1))) InVars {counter=v_counter_52, j2=v_j2_13, M2=v_M2_8} OutVars{counter=v_counter_51, j2=v_j2_12, M2=v_M2_8} AuxVars[] AssignedVars[counter, j2] 251#[L46-1, L23-1, L34-1, L74, L57-1]true [2023-10-12 17:41:04,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:04,998 INFO L85 PathProgramCache]: Analyzing trace with hash -45549966, now seen corresponding path program 1 times [2023-10-12 17:41:04,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:04,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980857080] [2023-10-12 17:41:04,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:04,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:05,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:05,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:05,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:05,012 INFO L85 PathProgramCache]: Analyzing trace with hash 158, now seen corresponding path program 1 times [2023-10-12 17:41:05,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:05,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072795202] [2023-10-12 17:41:05,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:05,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:05,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:05,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:05,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:05,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1412048819, now seen corresponding path program 1 times [2023-10-12 17:41:05,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:05,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031490261] [2023-10-12 17:41:05,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:05,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:05,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:05,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:05,051 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:05,051 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:05,051 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:05,051 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:05,051 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:05,051 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:05,051 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:05,051 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:05,052 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration6_Loop [2023-10-12 17:41:05,052 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:05,052 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:05,052 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:05,065 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:05,093 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:05,093 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:05,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:05,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:05,094 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:41:05,102 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:41:05,103 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:05,103 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:05,138 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:41:05,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:05,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:05,140 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:41:05,141 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:41:05,143 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:05,143 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:05,276 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:05,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-10-12 17:41:05,280 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:05,280 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:05,280 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:05,280 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:05,280 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:05,280 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:05,280 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:05,280 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:05,280 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration6_Loop [2023-10-12 17:41:05,280 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:05,280 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:05,281 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:41:05,289 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:41:05,317 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:05,317 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:05,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:05,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:05,319 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:41:05,320 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:41:05,322 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:41:05,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:05,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:05,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:05,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:05,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:05,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:05,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:05,340 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:05,343 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:41:05,343 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:05,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:05,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:05,345 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:41:05,347 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:41:05,348 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:05,348 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:05,348 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:05,348 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(j2, M2) = -1*j2 + 1*M2 Supporting invariants [] [2023-10-12 17:41:05,351 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:41:05,351 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:05,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:05,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:05,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:05,384 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:05,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:05,385 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:41:05,385 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:41:05,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:41:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2023-10-12 17:41:05,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:41:05,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:05,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:41:05,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:05,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:41:05,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:05,475 INFO L430 stractBuchiCegarLoop]: Abstraction has has 54 places, 3328 transitions, 62892 flow [2023-10-12 17:41:05,475 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:41:05,475 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 54 places, 3328 transitions, 62892 flow [2023-10-12 17:41:05,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:05,869 ERROR L47 etriNetUnfolderRabin]: [1:1A:[130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[][3], 2:2A:[104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][7], 4:3A:[124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][15], 7:4A:[107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][27], 22:5A:[124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][59], 85:6A:[121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2][167], 361:7A:[124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][431], 1105:8A:[123] L23-1-->thread1EXIT: Formula: (<= v_N1_4 v_i1_10) InVars {i1=v_i1_10, N1=v_N1_4} OutVars{i1=v_i1_10, N1=v_N1_4} AuxVars[] AssignedVars[][1043]][1106:9A:[121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2][1935]] [2023-10-12 17:41:05,869 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:05,870 INFO L124 PetriNetUnfolderBase]: 796/1105 cut-off events. [2023-10-12 17:41:05,870 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2023-10-12 17:41:05,870 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:05,871 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 50#[L71]true [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L23-1, L71-1]true [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 52#[L23-1, L71-1]true [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 87#[L23-1, L34-1, L72]true [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 87#[L23-1, L34-1, L72]true [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 87#[L23-1, L34-1, L72]true [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 87#[L23-1, L34-1, L72]true [123] L23-1-->thread1EXIT: Formula: (<= v_N1_4 v_i1_10) InVars {i1=v_i1_10, N1=v_N1_4} OutVars{i1=v_i1_10, N1=v_N1_4} AuxVars[] AssignedVars[] 301#[L34-1, L72, thread1EXIT]true [2023-10-12 17:41:05,871 INFO L750 eck$LassoCheckResult]: Loop: 301#[L34-1, L72, thread1EXIT]true [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 301#[L34-1, L72, thread1EXIT]true [2023-10-12 17:41:05,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:05,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1411629486, now seen corresponding path program 1 times [2023-10-12 17:41:05,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:05,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251205848] [2023-10-12 17:41:05,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:05,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:05,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:05,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:05,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 4 times [2023-10-12 17:41:05,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:05,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289211901] [2023-10-12 17:41:05,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:05,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:05,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:05,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:05,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:05,891 INFO L85 PathProgramCache]: Analyzing trace with hash -810840985, now seen corresponding path program 2 times [2023-10-12 17:41:05,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:05,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341502987] [2023-10-12 17:41:05,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:05,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:05,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:05,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:05,923 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:05,924 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:05,924 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:05,924 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:05,924 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:05,924 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:05,924 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:05,924 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:05,924 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration7_Loop [2023-10-12 17:41:05,924 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:05,924 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:05,925 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:41:05,929 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:41:05,951 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:05,951 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:05,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:05,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:05,953 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:41:05,955 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:41:05,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:05,957 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:05,982 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:41:05,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:05,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:05,984 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:41:05,986 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:41:05,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:05,988 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:06,094 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:06,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-10-12 17:41:06,098 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:06,098 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:06,098 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:06,098 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:06,098 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:06,098 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:06,098 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:06,098 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:06,098 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration7_Loop [2023-10-12 17:41:06,098 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:06,098 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:06,099 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:41:06,105 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:41:06,132 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:06,132 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:06,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:06,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:06,134 INFO L229 MonitoredProcess]: Starting monitored process 31 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:41:06,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-10-12 17:41:06,137 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:41:06,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:06,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:06,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:06,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:06,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:06,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:06,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:06,146 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:06,149 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:41:06,149 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:06,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:06,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:06,154 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:41:06,155 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:41:06,157 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:06,157 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:06,157 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:06,157 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N2) = -1*i2 + 1*N2 Supporting invariants [] [2023-10-12 17:41:06,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:06,169 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:06,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:06,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:06,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:06,208 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:06,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:06,208 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:41:06,209 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:41:06,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:41:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2023-10-12 17:41:06,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:41:06,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:06,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:41:06,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:06,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:41:06,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:06,370 INFO L430 stractBuchiCegarLoop]: Abstraction has has 58 places, 13312 transitions, 278192 flow [2023-10-12 17:41:06,370 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:41:06,370 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 58 places, 13312 transitions, 278192 flow [2023-10-12 17:41:06,919 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:41:08,781 ERROR L47 etriNetUnfolderRabin]: [1:1A:[130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[][15], 2:2A:[104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][31], 4:3A:[124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][63], 7:4A:[107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][111], 21:5A:[124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][239], 82:6A:[121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2][671], 353:7A:[124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][1727], 1116:8A:[121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2][4223]][1118:9A:[121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2][7743]] [2023-10-12 17:41:08,782 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:08,782 INFO L124 PetriNetUnfolderBase]: 785/1117 cut-off events. [2023-10-12 17:41:08,782 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2023-10-12 17:41:08,782 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:08,783 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 50#[L71]true [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L23-1, L71-1]true [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 52#[L23-1, L71-1]true [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 87#[L23-1, L34-1, L72]true [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 87#[L23-1, L34-1, L72]true [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 87#[L23-1, L34-1, L72]true [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 87#[L23-1, L34-1, L72]true [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 87#[L23-1, L34-1, L72]true [2023-10-12 17:41:08,783 INFO L750 eck$LassoCheckResult]: Loop: 87#[L23-1, L34-1, L72]true [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 87#[L23-1, L34-1, L72]true [2023-10-12 17:41:08,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:08,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1411629488, now seen corresponding path program 3 times [2023-10-12 17:41:08,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:08,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039440515] [2023-10-12 17:41:08,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:08,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:08,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:08,801 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 5 times [2023-10-12 17:41:08,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:08,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230845904] [2023-10-12 17:41:08,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:08,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:08,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:08,807 INFO L85 PathProgramCache]: Analyzing trace with hash -810841047, now seen corresponding path program 4 times [2023-10-12 17:41:08,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:08,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425400305] [2023-10-12 17:41:08,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:08,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:08,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:08,853 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:08,853 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:08,854 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:08,854 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:08,854 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:08,854 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:08,854 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:08,854 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:08,854 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration8_Loop [2023-10-12 17:41:08,854 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:08,854 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:08,855 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:41:08,860 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:41:08,883 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:08,883 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:08,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:08,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:08,884 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:41:08,886 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:41:08,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:08,887 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:08,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-10-12 17:41:08,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:08,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:08,898 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:41:08,900 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:41:08,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:08,902 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:09,008 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:09,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-10-12 17:41:09,012 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:09,012 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:09,012 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:09,012 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:09,012 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:09,013 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:09,013 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:09,013 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:09,013 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration8_Loop [2023-10-12 17:41:09,013 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:09,013 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:09,013 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:41:09,019 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:41:09,043 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:09,043 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:09,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:09,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:09,044 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:41:09,049 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:41:09,051 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:41:09,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:09,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:09,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:09,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:09,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:09,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:09,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:09,071 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:09,074 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:41:09,074 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:41:09,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:09,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:09,077 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:41:09,080 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:41:09,081 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:09,081 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:09,081 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:09,081 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N2) = -1*i2 + 1*N2 Supporting invariants [] [2023-10-12 17:41:09,087 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:41:09,088 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:09,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:09,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:09,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:09,123 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:09,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:09,124 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:41:09,124 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:41:09,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:41:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2023-10-12 17:41:09,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:41:09,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:09,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:41:09,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:09,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 208 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:41:09,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:09,666 INFO L430 stractBuchiCegarLoop]: Abstraction has has 62 places, 53248 transitions, 1219264 flow [2023-10-12 17:41:09,666 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:41:09,666 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 62 places, 53248 transitions, 1219264 flow [2023-10-12 17:42:29,788 INFO L124 PetriNetUnfolderBase]: 6162/8509 cut-off events. [2023-10-12 17:42:29,788 INFO L125 PetriNetUnfolderBase]: For 2225/2225 co-relation queries the response was YES. [2023-10-12 17:42:29,788 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:42:29,793 INFO L201 PluginConnector]: Adding new model counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:42:29 BoogieIcfgContainer [2023-10-12 17:42:29,793 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:42:29,794 INFO L158 Benchmark]: Toolchain (without parser) took 93112.58ms. Allocated memory was 208.7MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 163.5MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2023-10-12 17:42:29,794 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 208.7MB. Free memory was 164.6MB in the beginning and 164.4MB in the end (delta: 186.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:42:29,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.25ms. Allocated memory is still 208.7MB. Free memory was 163.3MB in the beginning and 161.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:42:29,794 INFO L158 Benchmark]: Boogie Preprocessor took 25.19ms. Allocated memory is still 208.7MB. Free memory was 161.9MB in the beginning and 160.7MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:42:29,795 INFO L158 Benchmark]: RCFGBuilder took 251.21ms. Allocated memory is still 208.7MB. Free memory was 160.7MB in the beginning and 149.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:42:29,795 INFO L158 Benchmark]: BuchiAutomizer took 92806.60ms. Allocated memory was 208.7MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 149.7MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2023-10-12 17:42:29,796 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23ms. Allocated memory is still 208.7MB. Free memory was 164.6MB in the beginning and 164.4MB in the end (delta: 186.1kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.25ms. Allocated memory is still 208.7MB. Free memory was 163.3MB in the beginning and 161.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.19ms. Allocated memory is still 208.7MB. Free memory was 161.9MB in the beginning and 160.7MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 251.21ms. Allocated memory is still 208.7MB. Free memory was 160.7MB in the beginning and 149.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 92806.60ms. Allocated memory was 208.7MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 149.7MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (2 trivial, 8 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N1 + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function counter and consists of 4 locations. One deterministic module has affine ranking function -1 * j1 + M1 and consists of 4 locations. One deterministic module has affine ranking function counter and consists of 4 locations. One deterministic module has affine ranking function counter and consists of 4 locations. One deterministic module has affine ranking function -1 * j2 + M2 and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 92.6s and 9 iterations. TraceHistogramMax:0. Analysis of lassos took 2.8s. Construction of modules took 0.4s. Büchi inclusion checks took 5.8s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [8, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 786 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 778 mSDsluCounter, 572 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 182 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 683 IncrementalHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 390 mSDtfsCounter, 683 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp58 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 56ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s InitialAbstractionConstructionTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 40 PlacesBefore, 28 PlacesAfterwards, 31 TransitionsBefore, 19 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 2 FixpointIterations, 5 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 192 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 192, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 156, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 156, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 192, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 156, unknown conditional: 0, unknown unconditional: 156] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:42:29,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...