/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-1.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:38:27,995 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:38:28,029 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:38:28,043 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:38:28,043 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:38:28,043 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:38:28,044 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:38:28,044 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:38:28,045 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:38:28,045 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:38:28,045 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:38:28,045 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:38:28,046 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:38:28,046 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:38:28,046 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:38:28,046 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:38:28,047 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:38:28,047 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:38:28,047 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:38:28,047 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:38:28,047 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:38:28,058 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:38:28,058 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:38:28,058 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:38:28,058 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:38:28,059 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:38:28,059 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:38:28,059 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:38:28,059 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:38:28,059 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:38:28,060 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:38:28,060 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:38:28,060 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:38:28,061 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:38:28,061 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:38:28,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:38:28,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:38:28,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:38:28,259 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:38:28,260 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:38:28,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-1.wvr.bpl [2023-10-12 17:38:28,261 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-1.wvr.bpl' [2023-10-12 17:38:28,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:38:28,278 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:38:28,279 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:28,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:38:28,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:38:28,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:28" (1/1) ... [2023-10-12 17:38:28,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:28" (1/1) ... [2023-10-12 17:38:28,296 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:38:28,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:28,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:38:28,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:38:28,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:38:28,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:28" (1/1) ... [2023-10-12 17:38:28,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:28" (1/1) ... [2023-10-12 17:38:28,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:28" (1/1) ... [2023-10-12 17:38:28,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:28" (1/1) ... [2023-10-12 17:38:28,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:28" (1/1) ... [2023-10-12 17:38:28,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:28" (1/1) ... [2023-10-12 17:38:28,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:28" (1/1) ... [2023-10-12 17:38:28,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:28" (1/1) ... [2023-10-12 17:38:28,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:38:28,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:38:28,310 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:38:28,310 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:38:28,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:28" (1/1) ... [2023-10-12 17:38:28,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:28,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:28,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:28,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:38:28,357 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:38:28,357 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:38:28,357 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:38:28,357 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:38:28,357 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:38:28,357 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:38:28,357 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:38:28,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:38:28,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:38:28,358 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:38:28,410 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:38:28,412 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:38:28,504 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:38:28,509 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:38:28,509 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:38:28,510 INFO L201 PluginConnector]: Adding new model misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:28 BoogieIcfgContainer [2023-10-12 17:38:28,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:38:28,511 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:38:28,511 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:38:28,514 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:38:28,514 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:28,515 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:28" (1/2) ... [2023-10-12 17:38:28,515 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5864888b and model type misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:38:28, skipping insertion in model container [2023-10-12 17:38:28,516 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:28,516 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:28" (2/2) ... [2023-10-12 17:38:28,517 INFO L332 chiAutomizerObserver]: Analyzing ICFG misc-1.wvr.bpl [2023-10-12 17:38:28,572 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:38:28,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 82 flow [2023-10-12 17:38:28,608 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2023-10-12 17:38:28,608 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:38:28,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 29 events. 4/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 66 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2023-10-12 17:38:28,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 82 flow [2023-10-12 17:38:28,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 29 transitions, 70 flow [2023-10-12 17:38:28,617 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:38:28,634 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 29 transitions, 70 flow [2023-10-12 17:38:28,636 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 29 transitions, 70 flow [2023-10-12 17:38:28,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 70 flow [2023-10-12 17:38:28,641 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2023-10-12 17:38:28,642 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:38:28,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 29 events. 4/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 66 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2023-10-12 17:38:28,644 INFO L119 LiptonReduction]: Number of co-enabled transitions 240 [2023-10-12 17:38:29,026 INFO L134 LiptonReduction]: Checked pairs total: 222 [2023-10-12 17:38:29,027 INFO L136 LiptonReduction]: Total number of compositions: 23 [2023-10-12 17:38:29,035 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:38:29,035 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:38:29,035 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:38:29,035 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:38:29,035 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:38:29,035 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:38:29,035 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:38:29,035 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:38:29,036 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:38:29,038 ERROR L47 etriNetUnfolderRabin]: [1:1A:[67] $Ultimate##0-->L60: Formula: (and (= v_bag1_8 v_sum1_5) (= v_bag1_8 v_sum2_5) (= v_bag1_8 0) (= v_j_9 v_bag1_8) (= v_i_9 v_bag1_8) (= v_bag2_8 v_bag1_8)) InVars {sum1=v_sum1_5, sum2=v_sum2_5, bag2=v_bag2_8, j=v_j_9, i=v_i_9, bag1=v_bag1_8} OutVars{sum1=v_sum1_5, sum2=v_sum2_5, bag2=v_bag2_8, j=v_j_9, i=v_i_9, bag1=v_bag1_8} AuxVars[] AssignedVars[][4], 2:2A:[94] L60-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][3]][3:3A:[121] L23-->L23: Formula: (let ((.cse3 (select v_A_In_1 v_i_In_1))) (let ((.cse1 (< v_i_In_1 v_N_In_1)) (.cse2 (= (+ v_i_In_1 1) v_i_Out_2)) (.cse0 (+ .cse3 v_bag1_In_1))) (or (and (< .cse0 v_cap1_In_1) .cse1 .cse2 (= v_sum1_In_1 v_sum1_Out_2) (= v_bag1_Out_2 .cse0)) (and .cse1 .cse2 (<= v_cap1_In_1 .cse0) (= (+ v_bag1_In_1 v_sum1_In_1) v_sum1_Out_2) (= .cse3 v_bag1_Out_2))))) InVars {A=v_A_In_1, sum1=v_sum1_In_1, cap1=v_cap1_In_1, N=v_N_In_1, i=v_i_In_1, bag1=v_bag1_In_1} OutVars{A=v_A_In_1, sum1=v_sum1_Out_2, cap1=v_cap1_In_1, N=v_N_In_1, i=v_i_Out_2, bag1=v_bag1_Out_2} AuxVars[] AssignedVars[sum1, i, bag1][9]] [2023-10-12 17:38:29,039 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:29,039 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:38:29,039 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:29,039 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:29,041 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:38:29,041 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:38:29,042 ERROR L47 etriNetUnfolderRabin]: [1:1A:[67] $Ultimate##0-->L60: Formula: (and (= v_bag1_8 v_sum1_5) (= v_bag1_8 v_sum2_5) (= v_bag1_8 0) (= v_j_9 v_bag1_8) (= v_i_9 v_bag1_8) (= v_bag2_8 v_bag1_8)) InVars {sum1=v_sum1_5, sum2=v_sum2_5, bag2=v_bag2_8, j=v_j_9, i=v_i_9, bag1=v_bag1_8} OutVars{sum1=v_sum1_5, sum2=v_sum2_5, bag2=v_bag2_8, j=v_j_9, i=v_i_9, bag1=v_bag1_8} AuxVars[] AssignedVars[][4], 2:2A:[94] L60-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][3]][3:3A:[121] L23-->L23: Formula: (let ((.cse3 (select v_A_In_1 v_i_In_1))) (let ((.cse1 (< v_i_In_1 v_N_In_1)) (.cse2 (= (+ v_i_In_1 1) v_i_Out_2)) (.cse0 (+ .cse3 v_bag1_In_1))) (or (and (< .cse0 v_cap1_In_1) .cse1 .cse2 (= v_sum1_In_1 v_sum1_Out_2) (= v_bag1_Out_2 .cse0)) (and .cse1 .cse2 (<= v_cap1_In_1 .cse0) (= (+ v_bag1_In_1 v_sum1_In_1) v_sum1_Out_2) (= .cse3 v_bag1_Out_2))))) InVars {A=v_A_In_1, sum1=v_sum1_In_1, cap1=v_cap1_In_1, N=v_N_In_1, i=v_i_In_1, bag1=v_bag1_In_1} OutVars{A=v_A_In_1, sum1=v_sum1_Out_2, cap1=v_cap1_In_1, N=v_N_In_1, i=v_i_Out_2, bag1=v_bag1_Out_2} AuxVars[] AssignedVars[sum1, i, bag1][9]] [2023-10-12 17:38:29,042 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:29,042 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:38:29,042 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:29,042 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:29,045 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [67] $Ultimate##0-->L60: Formula: (and (= v_bag1_8 v_sum1_5) (= v_bag1_8 v_sum2_5) (= v_bag1_8 0) (= v_j_9 v_bag1_8) (= v_i_9 v_bag1_8) (= v_bag2_8 v_bag1_8)) InVars {sum1=v_sum1_5, sum2=v_sum2_5, bag2=v_bag2_8, j=v_j_9, i=v_i_9, bag1=v_bag1_8} OutVars{sum1=v_sum1_5, sum2=v_sum2_5, bag2=v_bag2_8, j=v_j_9, i=v_i_9, bag1=v_bag1_8} AuxVars[] AssignedVars[] 40#[L60]true [94] L60-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 42#[L23, L60-1]true [2023-10-12 17:38:29,045 INFO L750 eck$LassoCheckResult]: Loop: 42#[L23, L60-1]true [121] L23-->L23: Formula: (let ((.cse3 (select v_A_In_1 v_i_In_1))) (let ((.cse1 (< v_i_In_1 v_N_In_1)) (.cse2 (= (+ v_i_In_1 1) v_i_Out_2)) (.cse0 (+ .cse3 v_bag1_In_1))) (or (and (< .cse0 v_cap1_In_1) .cse1 .cse2 (= v_sum1_In_1 v_sum1_Out_2) (= v_bag1_Out_2 .cse0)) (and .cse1 .cse2 (<= v_cap1_In_1 .cse0) (= (+ v_bag1_In_1 v_sum1_In_1) v_sum1_Out_2) (= .cse3 v_bag1_Out_2))))) InVars {A=v_A_In_1, sum1=v_sum1_In_1, cap1=v_cap1_In_1, N=v_N_In_1, i=v_i_In_1, bag1=v_bag1_In_1} OutVars{A=v_A_In_1, sum1=v_sum1_Out_2, cap1=v_cap1_In_1, N=v_N_In_1, i=v_i_Out_2, bag1=v_bag1_Out_2} AuxVars[] AssignedVars[sum1, i, bag1] 42#[L23, L60-1]true [2023-10-12 17:38:29,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash 3132, now seen corresponding path program 1 times [2023-10-12 17:38:29,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:29,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19065987] [2023-10-12 17:38:29,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:29,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:29,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:29,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:29,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 1 times [2023-10-12 17:38:29,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:29,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591221952] [2023-10-12 17:38:29,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:29,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:29,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:29,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:29,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:29,133 INFO L85 PathProgramCache]: Analyzing trace with hash 97213, now seen corresponding path program 1 times [2023-10-12 17:38:29,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:29,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057130250] [2023-10-12 17:38:29,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:29,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:29,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:29,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:29,265 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:29,266 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:29,266 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:29,266 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:29,266 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:29,266 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:29,266 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:29,266 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:29,266 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-1.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:38:29,267 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:29,267 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:29,278 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:29,285 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:29,287 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:29,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:38:29,291 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:29,486 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:29,489 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:29,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:29,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:29,492 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:29,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:38:29,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:38:29,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:29,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:29,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:29,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:29,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:29,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:29,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:29,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:29,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:29,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:29,525 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:29,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:38:29,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:38:29,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:29,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:29,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:29,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:29,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:29,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:29,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:29,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:29,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:29,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:29,559 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:29,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:38:29,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:29,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:29,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:29,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:29,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:29,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:29,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:38:29,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:29,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:29,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:29,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:29,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:29,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:38:29,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:38:29,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:29,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:29,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:29,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:29,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:29,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:29,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:29,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:29,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:29,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:29,645 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:29,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:38:29,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:38:29,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:29,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:29,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:29,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:29,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:29,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:29,674 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:29,679 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:38:29,679 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:38:29,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:29,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:29,683 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:29,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:38:29,685 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:29,706 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:29,707 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:29,707 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:38:29,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:38:29,724 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:29,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:29,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:29,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:29,781 WARN L260 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:38:29,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:38:29,802 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:38:29,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:38:29,883 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:38:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2023-10-12 17:38:29,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 224 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:38:29,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:29,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 224 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:29,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:29,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 224 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:38:29,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:29,888 INFO L430 stractBuchiCegarLoop]: Abstraction has has 20 places, 44 transitions, 224 flow [2023-10-12 17:38:29,888 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:38:29,888 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 20 places, 44 transitions, 224 flow [2023-10-12 17:38:29,889 ERROR L47 etriNetUnfolderRabin]: [1:1A:[67] $Ultimate##0-->L60: Formula: (and (= v_bag1_8 v_sum1_5) (= v_bag1_8 v_sum2_5) (= v_bag1_8 0) (= v_j_9 v_bag1_8) (= v_i_9 v_bag1_8) (= v_bag2_8 v_bag1_8)) InVars {sum1=v_sum1_5, sum2=v_sum2_5, bag2=v_bag2_8, j=v_j_9, i=v_i_9, bag1=v_bag1_8} OutVars{sum1=v_sum1_5, sum2=v_sum2_5, bag2=v_bag2_8, j=v_j_9, i=v_i_9, bag1=v_bag1_8} AuxVars[] AssignedVars[][16], 2:2A:[94] L60-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][12], 4:3A:[97] L60-1-->L41: 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][7]][5:4A:[122] L41-->L41: Formula: (let ((.cse3 (select v_A_In_3 v_j_In_1))) (let ((.cse0 (= (+ v_j_In_1 1) v_j_Out_2)) (.cse2 (+ .cse3 v_bag2_In_1)) (.cse1 (< v_j_In_1 v_N_In_3))) (or (and (= v_sum2_Out_2 v_sum2_In_1) .cse0 .cse1 (= .cse2 v_bag2_Out_2) (< .cse2 v_cap2_In_1)) (and .cse0 (<= v_cap2_In_1 .cse2) .cse1 (= v_sum2_Out_2 (+ v_bag2_In_1 v_sum2_In_1)) (= .cse3 v_bag2_Out_2))))) InVars {A=v_A_In_3, cap2=v_cap2_In_1, sum2=v_sum2_In_1, N=v_N_In_3, bag2=v_bag2_In_1, j=v_j_In_1} OutVars{A=v_A_In_3, cap2=v_cap2_In_1, sum2=v_sum2_Out_2, N=v_N_In_3, bag2=v_bag2_Out_2, j=v_j_Out_2} AuxVars[] AssignedVars[sum2, bag2, j][42]] [2023-10-12 17:38:29,889 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:29,889 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:38:29,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:29,890 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:29,890 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [67] $Ultimate##0-->L60: Formula: (and (= v_bag1_8 v_sum1_5) (= v_bag1_8 v_sum2_5) (= v_bag1_8 0) (= v_j_9 v_bag1_8) (= v_i_9 v_bag1_8) (= v_bag2_8 v_bag1_8)) InVars {sum1=v_sum1_5, sum2=v_sum2_5, bag2=v_bag2_8, j=v_j_9, i=v_i_9, bag1=v_bag1_8} OutVars{sum1=v_sum1_5, sum2=v_sum2_5, bag2=v_bag2_8, j=v_j_9, i=v_i_9, bag1=v_bag1_8} AuxVars[] AssignedVars[] 40#[L60]true [94] L60-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 42#[L23, L60-1]true [97] L60-1-->L41: 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] 77#[L61, L23, L41]true [2023-10-12 17:38:29,890 INFO L750 eck$LassoCheckResult]: Loop: 77#[L61, L23, L41]true [122] L41-->L41: Formula: (let ((.cse3 (select v_A_In_3 v_j_In_1))) (let ((.cse0 (= (+ v_j_In_1 1) v_j_Out_2)) (.cse2 (+ .cse3 v_bag2_In_1)) (.cse1 (< v_j_In_1 v_N_In_3))) (or (and (= v_sum2_Out_2 v_sum2_In_1) .cse0 .cse1 (= .cse2 v_bag2_Out_2) (< .cse2 v_cap2_In_1)) (and .cse0 (<= v_cap2_In_1 .cse2) .cse1 (= v_sum2_Out_2 (+ v_bag2_In_1 v_sum2_In_1)) (= .cse3 v_bag2_Out_2))))) InVars {A=v_A_In_3, cap2=v_cap2_In_1, sum2=v_sum2_In_1, N=v_N_In_3, bag2=v_bag2_In_1, j=v_j_In_1} OutVars{A=v_A_In_3, cap2=v_cap2_In_1, sum2=v_sum2_Out_2, N=v_N_In_3, bag2=v_bag2_Out_2, j=v_j_Out_2} AuxVars[] AssignedVars[sum2, bag2, j] 77#[L61, L23, L41]true [2023-10-12 17:38:29,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:29,890 INFO L85 PathProgramCache]: Analyzing trace with hash 97189, now seen corresponding path program 1 times [2023-10-12 17:38:29,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:29,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770273237] [2023-10-12 17:38:29,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:29,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:29,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:29,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:29,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:29,898 INFO L85 PathProgramCache]: Analyzing trace with hash 153, now seen corresponding path program 1 times [2023-10-12 17:38:29,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:29,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110385361] [2023-10-12 17:38:29,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:29,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:29,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:29,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:29,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:29,907 INFO L85 PathProgramCache]: Analyzing trace with hash 3012981, now seen corresponding path program 1 times [2023-10-12 17:38:29,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:29,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080406472] [2023-10-12 17:38:29,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:29,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:29,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:29,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:30,019 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:30,019 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:30,019 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:30,020 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:30,020 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:30,020 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:30,020 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:30,020 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:30,020 INFO L133 ssoRankerPreferences]: Filename of dumped script: misc-1.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:38:30,020 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:30,020 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:30,021 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:30,076 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:30,079 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:30,082 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:30,084 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:30,103 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:30,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:38:30,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-10-12 17:38:30,246 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:30,246 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:30,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:30,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:30,256 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:30,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:38:30,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:38:30,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:30,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:30,279 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:38:30,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:30,294 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:38:30,294 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:38:30,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:30,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:38:30,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:30,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:30,329 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:30,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:38:30,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:38:30,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:30,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:30,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:30,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:30,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:30,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:30,369 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:30,372 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:38:30,372 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:38:30,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:30,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:30,383 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:30,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:38:30,386 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:30,403 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:30,403 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:30,403 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(j, N) = -1*j + 1*N Supporting invariants [] [2023-10-12 17:38:30,423 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:38:30,424 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:30,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:30,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:30,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:30,448 WARN L260 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:38:30,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:38:30,449 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:38:30,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:38:30,523 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:38:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2023-10-12 17:38:30,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 224 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:30,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:30,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 224 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:38:30,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:30,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 224 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:38:30,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:30,525 INFO L430 stractBuchiCegarLoop]: Abstraction has has 24 places, 176 transitions, 1248 flow [2023-10-12 17:38:30,525 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:38:30,525 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 176 transitions, 1248 flow [2023-10-12 17:38:30,529 INFO L124 PetriNetUnfolderBase]: 16/32 cut-off events. [2023-10-12 17:38:30,529 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:38:30,530 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:38:30,534 INFO L201 PluginConnector]: Adding new model misc-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:38:30 BoogieIcfgContainer [2023-10-12 17:38:30,534 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:38:30,534 INFO L158 Benchmark]: Toolchain (without parser) took 2256.46ms. Allocated memory was 198.2MB in the beginning and 240.1MB in the end (delta: 41.9MB). Free memory was 149.2MB in the beginning and 187.0MB in the end (delta: -37.8MB). Peak memory consumption was 6.1MB. Max. memory is 8.0GB. [2023-10-12 17:38:30,535 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 198.2MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:38:30,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.11ms. Allocated memory is still 198.2MB. Free memory was 149.1MB in the beginning and 147.6MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-10-12 17:38:30,535 INFO L158 Benchmark]: Boogie Preprocessor took 11.95ms. Allocated memory is still 198.2MB. Free memory was 147.6MB in the beginning and 146.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:30,535 INFO L158 Benchmark]: RCFGBuilder took 200.76ms. Allocated memory is still 198.2MB. Free memory was 146.4MB in the beginning and 164.5MB in the end (delta: -18.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-10-12 17:38:30,536 INFO L158 Benchmark]: BuchiAutomizer took 2022.63ms. Allocated memory was 198.2MB in the beginning and 240.1MB in the end (delta: 41.9MB). Free memory was 164.5MB in the beginning and 187.0MB in the end (delta: -22.5MB). Peak memory consumption was 20.7MB. Max. memory is 8.0GB. [2023-10-12 17:38:30,537 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 198.2MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.11ms. Allocated memory is still 198.2MB. Free memory was 149.1MB in the beginning and 147.6MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.95ms. Allocated memory is still 198.2MB. Free memory was 147.6MB in the beginning and 146.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 200.76ms. Allocated memory is still 198.2MB. Free memory was 146.4MB in the beginning and 164.5MB in the end (delta: -18.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2022.63ms. Allocated memory was 198.2MB in the beginning and 240.1MB in the end (delta: 41.9MB). Free memory was 164.5MB in the beginning and 187.0MB in the end (delta: -22.5MB). Peak memory consumption was 20.7MB. 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 184 IncrementalHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 92 mSDtfsCounter, 184 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital78 mio100 ax100 hnf100 lsp166 ukn50 mio100 lsp83 div100 bol100 ite100 ukn100 eq176 hnf97 smp100 dnf107 smp56 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 66ms VariablesStem: 2 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.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.4s, 32 PlacesBefore, 16 PlacesAfterwards, 29 TransitionsBefore, 11 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 14 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 23 TotalNumberOfCompositions, 222 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 222, independent: 222, independent conditional: 0, independent unconditional: 222, 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: 168, independent: 168, independent conditional: 0, independent unconditional: 168, 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: 168, independent: 168, independent conditional: 0, independent unconditional: 168, 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: 222, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 168, unknown conditional: 0, unknown unconditional: 168] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, 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:38:30,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:38:30,752 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...