/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/POPL2023/map-aggr-update1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:36:53,965 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:36:54,035 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:36:54,058 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:36:54,059 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:36:54,059 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:36:54,060 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:36:54,060 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:36:54,061 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:36:54,064 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:36:54,064 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:36:54,064 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:36:54,064 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:36:54,065 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:36:54,066 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:36:54,066 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:36:54,066 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:36:54,066 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:36:54,066 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:36:54,066 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:36:54,066 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:36:54,067 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:36:54,067 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:36:54,067 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:36:54,067 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:36:54,067 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:36:54,067 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:36:54,068 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:36:54,068 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:36:54,068 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:36:54,069 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:36:54,069 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:36:54,069 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:36:54,070 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:36:54,070 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:36:54,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:36:54,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:36:54,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:36:54,299 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:36:54,300 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:36:54,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1.bpl [2023-10-12 17:36:54,301 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1.bpl' [2023-10-12 17:36:54,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:36:54,335 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:36:54,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:54,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:36:54,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:36:54,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:54" (1/1) ... [2023-10-12 17:36:54,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:54" (1/1) ... [2023-10-12 17:36:54,386 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:36:54,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:54,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:36:54,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:36:54,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:36:54,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:54" (1/1) ... [2023-10-12 17:36:54,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:54" (1/1) ... [2023-10-12 17:36:54,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:54" (1/1) ... [2023-10-12 17:36:54,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:54" (1/1) ... [2023-10-12 17:36:54,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:54" (1/1) ... [2023-10-12 17:36:54,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:54" (1/1) ... [2023-10-12 17:36:54,413 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:54" (1/1) ... [2023-10-12 17:36:54,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:54" (1/1) ... [2023-10-12 17:36:54,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:36:54,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:36:54,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:36:54,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:36:54,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:54" (1/1) ... [2023-10-12 17:36:54,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:54,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:54,659 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:36:54,690 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:36:54,709 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:36:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:36:54,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:36:54,710 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:36:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:36:54,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:36:54,710 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:36:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:36:54,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:36:54,710 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:36:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:36:54,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:36:54,711 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:36:54,747 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:36:54,749 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:36:54,873 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:36:54,878 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:36:54,878 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:36:54,879 INFO L201 PluginConnector]: Adding new model map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:54 BoogieIcfgContainer [2023-10-12 17:36:54,879 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:36:54,880 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:36:54,880 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:36:54,882 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:36:54,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:54,883 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:54" (1/2) ... [2023-10-12 17:36:54,884 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22dad253 and model type map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:36:54, skipping insertion in model container [2023-10-12 17:36:54,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:54,884 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:54" (2/2) ... [2023-10-12 17:36:54,885 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-aggr-update1.bpl [2023-10-12 17:36:54,938 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:36:54,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 104 flow [2023-10-12 17:36:54,976 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2023-10-12 17:36:54,976 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:36:54,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 5/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-10-12 17:36:54,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 40 transitions, 104 flow [2023-10-12 17:36:54,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 86 flow [2023-10-12 17:36:54,986 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:36:54,995 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 86 flow [2023-10-12 17:36:54,997 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 86 flow [2023-10-12 17:36:54,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 86 flow [2023-10-12 17:36:55,004 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2023-10-12 17:36:55,004 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:36:55,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 5/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-10-12 17:36:55,006 INFO L119 LiptonReduction]: Number of co-enabled transitions 456 [2023-10-12 17:36:55,386 INFO L134 LiptonReduction]: Checked pairs total: 360 [2023-10-12 17:36:55,387 INFO L136 LiptonReduction]: Total number of compositions: 18 [2023-10-12 17:36:55,396 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:36:55,396 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:36:55,396 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:36:55,396 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:36:55,396 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:36:55,396 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:36:55,396 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:36:55,396 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:36:55,397 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:36:55,399 ERROR L47 etriNetUnfolderRabin]: [1:1A:[83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[][9], 2:2A:[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i][8], 3:3A:[88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i][0]][4:4A:[137] L51-1-->L51-1: Formula: (and (= v_A_31 (store v_A_32 v_thread1Thread1of1ForFork0_i_26 (let ((.cse0 (select v_A_32 v_thread1Thread1of1ForFork0_i_26))) (ite (< .cse0 0) 0 .cse0)))) (= v_thread1Thread1of1ForFork0_i_25 (+ v_thread1Thread1of1ForFork0_i_26 1)) (< v_thread1Thread1of1ForFork0_i_26 v_N_28)) InVars {A=v_A_32, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_26} OutVars{A=v_A_31, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_25} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork0_i][16]] [2023-10-12 17:36:55,401 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:55,402 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:36:55,403 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:55,404 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:55,409 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:36:55,409 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:36:55,410 ERROR L47 etriNetUnfolderRabin]: [1:1A:[83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[][9], 2:2A:[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i][8], 3:3A:[88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i][0]][4:4A:[137] L51-1-->L51-1: Formula: (and (= v_A_31 (store v_A_32 v_thread1Thread1of1ForFork0_i_26 (let ((.cse0 (select v_A_32 v_thread1Thread1of1ForFork0_i_26))) (ite (< .cse0 0) 0 .cse0)))) (= v_thread1Thread1of1ForFork0_i_25 (+ v_thread1Thread1of1ForFork0_i_26 1)) (< v_thread1Thread1of1ForFork0_i_26 v_N_28)) InVars {A=v_A_32, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_26} OutVars{A=v_A_31, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_25} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork0_i][16]] [2023-10-12 17:36:55,411 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:55,411 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:36:55,411 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:55,411 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:55,415 INFO L748 eck$LassoCheckResult]: Stem: 46#[$Ultimate##0]true [83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 48#[L34]true [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[L34-1, $Ultimate##0]true [88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 52#[L51-1, L34-1]true [2023-10-12 17:36:55,415 INFO L750 eck$LassoCheckResult]: Loop: 52#[L51-1, L34-1]true [137] L51-1-->L51-1: Formula: (and (= v_A_31 (store v_A_32 v_thread1Thread1of1ForFork0_i_26 (let ((.cse0 (select v_A_32 v_thread1Thread1of1ForFork0_i_26))) (ite (< .cse0 0) 0 .cse0)))) (= v_thread1Thread1of1ForFork0_i_25 (+ v_thread1Thread1of1ForFork0_i_26 1)) (< v_thread1Thread1of1ForFork0_i_26 v_N_28)) InVars {A=v_A_32, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_26} OutVars{A=v_A_31, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_25} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork0_i] 52#[L51-1, L34-1]true [2023-10-12 17:36:55,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:55,419 INFO L85 PathProgramCache]: Analyzing trace with hash 113176, now seen corresponding path program 1 times [2023-10-12 17:36:55,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:55,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889647805] [2023-10-12 17:36:55,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:55,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:55,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:55,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:55,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:55,556 INFO L85 PathProgramCache]: Analyzing trace with hash 168, now seen corresponding path program 1 times [2023-10-12 17:36:55,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:55,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676363812] [2023-10-12 17:36:55,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:55,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:55,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:55,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:55,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:55,582 INFO L85 PathProgramCache]: Analyzing trace with hash 3508593, now seen corresponding path program 1 times [2023-10-12 17:36:55,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:55,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394243244] [2023-10-12 17:36:55,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:55,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:55,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:55,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:55,697 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:55,698 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:55,698 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:55,698 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:55,698 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:55,698 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:55,698 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:55,698 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:55,698 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:36:55,698 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:55,699 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:55,711 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:36:55,719 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:36:55,770 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:55,773 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:55,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:55,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:55,792 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:36:55,798 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:36:55,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:55,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:55,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:55,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:55,809 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:36:55,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:55,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:55,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:55,849 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:36:55,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:55,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:55,865 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:36:55,889 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:36:55,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:55,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:55,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:55,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:55,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:55,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:55,909 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:36:55,913 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:55,933 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:36:55,933 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:36:55,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:55,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:55,943 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:36:55,944 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:36:55,990 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:56,013 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:36:56,014 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:56,014 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2023-10-12 17:36:56,020 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:36:56,023 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:56,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:56,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:56,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:56,082 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:56,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:56,083 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:36:56,114 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:36:56,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:56,212 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:36:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2023-10-12 17:36:56,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:36:56,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:56,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:36:56,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:56,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:36:56,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:56,217 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 72 transitions, 360 flow [2023-10-12 17:36:56,217 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:36:56,217 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 72 transitions, 360 flow [2023-10-12 17:36:56,220 ERROR L47 etriNetUnfolderRabin]: [1:1A:[83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[][38], 2:2A:[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i][34], 5:3A:[117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1][14], 16:4A:[134] $Ultimate##0-->L65-1: Formula: (and (= v_thread2Thread1of1ForFork1_cnt_23 0) (= v_thread2Thread1of1ForFork1_j_39 0)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_39, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt][42]][18:5A:[141] L65-1-->L65-1: Formula: (and (let ((.cse0 (= v_thread2Thread1of1ForFork1_j_59 (+ v_thread2Thread1of1ForFork1_j_60 1))) (.cse1 (select v_B_29 v_thread2Thread1of1ForFork1_j_60))) (or (and .cse0 (= v_thread2Thread1of1ForFork1_cnt_42 v_thread2Thread1of1ForFork1_cnt_41) (<= .cse1 0)) (and .cse0 (< 0 .cse1) (= v_thread2Thread1of1ForFork1_cnt_41 (+ v_thread2Thread1of1ForFork1_cnt_42 1))))) (let ((.cse3 (select v_A_39 v_thread2Thread1of1ForFork1_j_60)) (.cse2 (< v_thread2Thread1of1ForFork1_j_60 v_N_36))) (or (and (= v_thread2Thread1of1ForFork1_cnt_42 (+ v_thread2Thread1of1ForFork1_cnt_43 1)) .cse2 (< 0 .cse3)) (and (= v_thread2Thread1of1ForFork1_cnt_43 v_thread2Thread1of1ForFork1_cnt_42) (<= .cse3 0) .cse2)))) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_60, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_43} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_59, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_41} AuxVars[v_thread2Thread1of1ForFork1_cnt_42] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt][70]] [2023-10-12 17:36:56,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:56,220 INFO L124 PetriNetUnfolderBase]: 8/17 cut-off events. [2023-10-12 17:36:56,220 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:36:56,220 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:56,221 INFO L748 eck$LassoCheckResult]: Stem: 46#[$Ultimate##0]true [83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 48#[L34]true [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[L34-1, $Ultimate##0]true [117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 92#[$Ultimate##0, $Ultimate##0, L35]true [134] $Ultimate##0-->L65-1: Formula: (and (= v_thread2Thread1of1ForFork1_cnt_23 0) (= v_thread2Thread1of1ForFork1_j_39 0)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_39, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt] 94#[$Ultimate##0, L65-1, L35]true [2023-10-12 17:36:56,221 INFO L750 eck$LassoCheckResult]: Loop: 94#[$Ultimate##0, L65-1, L35]true [141] L65-1-->L65-1: Formula: (and (let ((.cse0 (= v_thread2Thread1of1ForFork1_j_59 (+ v_thread2Thread1of1ForFork1_j_60 1))) (.cse1 (select v_B_29 v_thread2Thread1of1ForFork1_j_60))) (or (and .cse0 (= v_thread2Thread1of1ForFork1_cnt_42 v_thread2Thread1of1ForFork1_cnt_41) (<= .cse1 0)) (and .cse0 (< 0 .cse1) (= v_thread2Thread1of1ForFork1_cnt_41 (+ v_thread2Thread1of1ForFork1_cnt_42 1))))) (let ((.cse3 (select v_A_39 v_thread2Thread1of1ForFork1_j_60)) (.cse2 (< v_thread2Thread1of1ForFork1_j_60 v_N_36))) (or (and (= v_thread2Thread1of1ForFork1_cnt_42 (+ v_thread2Thread1of1ForFork1_cnt_43 1)) .cse2 (< 0 .cse3)) (and (= v_thread2Thread1of1ForFork1_cnt_43 v_thread2Thread1of1ForFork1_cnt_42) (<= .cse3 0) .cse2)))) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_60, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_43} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_59, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_41} AuxVars[v_thread2Thread1of1ForFork1_cnt_42] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt] 94#[$Ultimate##0, L65-1, L35]true [2023-10-12 17:36:56,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:56,221 INFO L85 PathProgramCache]: Analyzing trace with hash 3509489, now seen corresponding path program 1 times [2023-10-12 17:36:56,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:56,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878759010] [2023-10-12 17:36:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:56,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:56,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:56,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:56,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash 172, now seen corresponding path program 1 times [2023-10-12 17:36:56,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:56,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106111127] [2023-10-12 17:36:56,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:56,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:56,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:56,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:56,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:56,238 INFO L85 PathProgramCache]: Analyzing trace with hash 108794300, now seen corresponding path program 1 times [2023-10-12 17:36:56,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:56,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962003058] [2023-10-12 17:36:56,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:56,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:56,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:56,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:56,391 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:56,391 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:56,391 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:56,391 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:56,391 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:56,391 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:56,392 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:56,392 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:56,392 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:36:56,392 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:56,392 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:56,395 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:36:56,489 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:36:56,492 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:36:56,494 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:36:56,497 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:36:56,649 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:36:56,694 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:56,694 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:56,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:56,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:56,713 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:36:56,715 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:36:56,716 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:36:56,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:56,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:56,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:56,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:56,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:56,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:56,749 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:56,769 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:36:56,769 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:36:56,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:56,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:56,771 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:36:56,773 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:36:56,774 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:56,800 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:36:56,800 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:56,800 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2023-10-12 17:36:56,816 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:36:56,818 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:56,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:56,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:56,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:56,840 WARN L260 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:56,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:56,841 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:36:56,841 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:36:56,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2023-10-12 17:36:56,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 168 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:36:56,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:56,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 168 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:36:56,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:56,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 168 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:36:56,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:56,920 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 288 transitions, 2016 flow [2023-10-12 17:36:56,920 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:36:56,924 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 33 places, 288 transitions, 2016 flow [2023-10-12 17:36:56,934 ERROR L47 etriNetUnfolderRabin]: [1:1A:[83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[][152], 2:2A:[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i][136], 5:3A:[117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1][56], 15:4A:[120] L35-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k][88], 36:5A:[106] $Ultimate##0-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k][72]][37:6A:[138] L83-1-->L83-1: Formula: (and (= v_thread3Thread1of1ForFork2_k_25 (+ v_thread3Thread1of1ForFork2_k_26 1)) (< v_thread3Thread1of1ForFork2_k_26 v_N_32) (= v_B_25 (store v_B_26 v_thread3Thread1of1ForFork2_k_26 v_thread3Thread1of1ForFork2_k_26))) InVars {N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_26, B=v_B_26} OutVars{N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_25, B=v_B_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k, B][248]] [2023-10-12 17:36:56,934 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:56,934 INFO L124 PetriNetUnfolderBase]: 21/36 cut-off events. [2023-10-12 17:36:56,934 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:36:56,935 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:56,935 INFO L748 eck$LassoCheckResult]: Stem: 46#[$Ultimate##0]true [83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 48#[L34]true [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[L34-1, $Ultimate##0]true [117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 92#[$Ultimate##0, $Ultimate##0, L35]true [120] L35-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k] 132#[$Ultimate##0, $Ultimate##0, L36, $Ultimate##0]true [106] $Ultimate##0-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 134#[$Ultimate##0, L83-1, $Ultimate##0, L36]true [2023-10-12 17:36:56,935 INFO L750 eck$LassoCheckResult]: Loop: 134#[$Ultimate##0, L83-1, $Ultimate##0, L36]true [138] L83-1-->L83-1: Formula: (and (= v_thread3Thread1of1ForFork2_k_25 (+ v_thread3Thread1of1ForFork2_k_26 1)) (< v_thread3Thread1of1ForFork2_k_26 v_N_32) (= v_B_25 (store v_B_26 v_thread3Thread1of1ForFork2_k_26 v_thread3Thread1of1ForFork2_k_26))) InVars {N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_26, B=v_B_26} OutVars{N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_25, B=v_B_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k, B] 134#[$Ultimate##0, L83-1, $Ultimate##0, L36]true [2023-10-12 17:36:56,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:56,936 INFO L85 PathProgramCache]: Analyzing trace with hash 108793831, now seen corresponding path program 1 times [2023-10-12 17:36:56,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:56,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125399831] [2023-10-12 17:36:56,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:56,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:56,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:56,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:56,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:56,943 INFO L85 PathProgramCache]: Analyzing trace with hash 169, now seen corresponding path program 1 times [2023-10-12 17:36:56,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:56,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126734688] [2023-10-12 17:36:56,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:56,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:56,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:56,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:56,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:56,949 INFO L85 PathProgramCache]: Analyzing trace with hash -922358397, now seen corresponding path program 1 times [2023-10-12 17:36:56,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:56,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536103601] [2023-10-12 17:36:56,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:56,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:56,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:56,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:57,006 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:57,006 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:57,006 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:57,006 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:57,006 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:57,006 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:57,006 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:57,006 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:57,006 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:36:57,007 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:57,007 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:57,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:36:57,009 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:36:57,011 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:36:57,012 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:36:57,014 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:36:57,022 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:36:57,024 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:36:57,026 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:36:57,028 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:36:57,030 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:36:57,090 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:57,090 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:57,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:57,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:57,091 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:36:57,094 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:36:57,095 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:36:57,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:57,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:57,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:57,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:57,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:57,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:57,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:57,118 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:57,121 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:36:57,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:57,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:57,123 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:36:57,123 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:36:57,127 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:36:57,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:57,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:57,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:57,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:57,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:57,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:57,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:57,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:57,172 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:36:57,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:57,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:57,173 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:36:57,193 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:36:57,194 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:36:57,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:57,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:57,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:57,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:57,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:57,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:57,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:57,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:57,207 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:36:57,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:57,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:57,209 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:36:57,211 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:36:57,212 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:36:57,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:57,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:57,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:57,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:57,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:57,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:57,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:57,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:57,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:57,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:57,241 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:36:57,242 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:36:57,243 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:36:57,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:57,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:57,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:57,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:57,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:57,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:57,261 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:57,268 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:36:57,268 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:36:57,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:57,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:57,280 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:36:57,285 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:36:57,286 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:57,293 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:36:57,294 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:57,294 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_k, N) = -1*thread3Thread1of1ForFork2_k + 1*N Supporting invariants [] [2023-10-12 17:36:57,297 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:36:57,298 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:57,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:57,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:57,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:57,320 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:57,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:57,321 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:36:57,321 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:36:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:57,392 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:36:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2023-10-12 17:36:57,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:36:57,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:57,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:36:57,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:57,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:36:57,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:57,393 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 1152 transitions, 10368 flow [2023-10-12 17:36:57,393 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:36:57,393 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 37 places, 1152 transitions, 10368 flow [2023-10-12 17:36:57,435 INFO L124 PetriNetUnfolderBase]: 193/282 cut-off events. [2023-10-12 17:36:57,435 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2023-10-12 17:36:57,435 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:36:57,439 INFO L201 PluginConnector]: Adding new model map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:36:57 BoogieIcfgContainer [2023-10-12 17:36:57,440 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:36:57,440 INFO L158 Benchmark]: Toolchain (without parser) took 3104.79ms. Allocated memory was 229.6MB in the beginning and 280.0MB in the end (delta: 50.3MB). Free memory was 180.4MB in the beginning and 176.0MB in the end (delta: 4.4MB). Peak memory consumption was 55.4MB. Max. memory is 8.0GB. [2023-10-12 17:36:57,441 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 229.6MB. Free memory was 181.5MB in the beginning and 181.4MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:36:57,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.56ms. Allocated memory is still 229.6MB. Free memory was 180.2MB in the beginning and 178.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:36:57,441 INFO L158 Benchmark]: Boogie Preprocessor took 26.82ms. Allocated memory is still 229.6MB. Free memory was 178.7MB in the beginning and 177.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:57,441 INFO L158 Benchmark]: RCFGBuilder took 464.39ms. Allocated memory is still 229.6MB. Free memory was 177.5MB in the beginning and 198.5MB in the end (delta: -21.0MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2023-10-12 17:36:57,442 INFO L158 Benchmark]: BuchiAutomizer took 2559.81ms. Allocated memory was 229.6MB in the beginning and 280.0MB in the end (delta: 50.3MB). Free memory was 198.5MB in the beginning and 176.0MB in the end (delta: 22.5MB). Peak memory consumption was 72.3MB. Max. memory is 8.0GB. [2023-10-12 17:36:57,443 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.22ms. Allocated memory is still 229.6MB. Free memory was 181.5MB in the beginning and 181.4MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.56ms. Allocated memory is still 229.6MB. Free memory was 180.2MB in the beginning and 178.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.82ms. Allocated memory is still 229.6MB. Free memory was 178.7MB in the beginning and 177.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 464.39ms. Allocated memory is still 229.6MB. Free memory was 177.5MB in the beginning and 198.5MB in the end (delta: -21.0MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2559.81ms. Allocated memory was 229.6MB in the beginning and 280.0MB in the end (delta: 50.3MB). Free memory was 198.5MB in the beginning and 176.0MB in the end (delta: 22.5MB). Peak memory consumption was 72.3MB. 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. One deterministic module has affine ranking function N + -1 * j and consists of 3 locations. One deterministic module has affine ranking function -1 * k + N and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 328 mSDsluCounter, 243 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 283 IncrementalHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 174 mSDtfsCounter, 283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital64 mio100 ax100 hnf100 lsp151 ukn45 mio100 lsp92 div100 bol100 ite100 ukn100 eq156 hnf95 smp100 dnf164 smp74 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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, 39 PlacesBefore, 25 PlacesAfterwards, 34 TransitionsBefore, 18 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 18 TotalNumberOfCompositions, 360 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 330, independent: 327, independent conditional: 0, independent unconditional: 327, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 249, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 249, independent: 242, independent conditional: 0, independent unconditional: 242, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 330, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 249, unknown conditional: 0, unknown unconditional: 249] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, 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:36:57,456 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:36:57,658 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:36:57,862 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...