/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 BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-decr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:18:37,032 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:18:37,114 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:18:37,142 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:18:37,142 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:18:37,143 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:18:37,144 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:18:37,144 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:18:37,145 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:18:37,148 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:18:37,149 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:18:37,149 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:18:37,149 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:18:37,150 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:18:37,151 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:18:37,151 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:18:37,151 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:18:37,152 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:18:37,152 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:18:37,152 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:18:37,152 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:18:37,154 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:18:37,154 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:18:37,154 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:18:37,154 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:18:37,154 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:18:37,155 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:18:37,155 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:18:37,155 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:18:37,155 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:18:37,156 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:18:37,157 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:18:37,157 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:18:37,158 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:18:37,158 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 -> BUCHI_PETRI_NET [2023-10-12 17:18:37,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:18:37,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:18:37,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:18:37,419 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:18:37,421 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:18:37,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-decr.bpl [2023-10-12 17:18:37,422 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-incr-decr.bpl' [2023-10-12 17:18:37,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:18:37,450 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:18:37,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:37,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:18:37,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:18:37,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:37" (1/1) ... [2023-10-12 17:18:37,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:37" (1/1) ... [2023-10-12 17:18:37,475 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:18:37,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:37,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:18:37,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:18:37,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:18:37,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:37" (1/1) ... [2023-10-12 17:18:37,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:37" (1/1) ... [2023-10-12 17:18:37,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:37" (1/1) ... [2023-10-12 17:18:37,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:37" (1/1) ... [2023-10-12 17:18:37,490 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:37" (1/1) ... [2023-10-12 17:18:37,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:37" (1/1) ... [2023-10-12 17:18:37,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:37" (1/1) ... [2023-10-12 17:18:37,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:37" (1/1) ... [2023-10-12 17:18:37,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:18:37,497 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:18:37,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:18:37,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:18:37,498 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:37" (1/1) ... [2023-10-12 17:18:37,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:37,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:37,526 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:18:37,539 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:18:37,561 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:18:37,561 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:18:37,564 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:18:37,564 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:18:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:18:37,565 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:18:37,565 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:18:37,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:18:37,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:18:37,566 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:18:37,609 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:18:37,611 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:18:37,698 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:18:37,704 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:18:37,704 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:18:37,705 INFO L201 PluginConnector]: Adding new model map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:37 BoogieIcfgContainer [2023-10-12 17:18:37,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:18:37,706 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:18:37,707 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:18:37,713 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:18:37,714 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:37,714 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:37" (1/2) ... [2023-10-12 17:18:37,725 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12189670 and model type map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:18:37, skipping insertion in model container [2023-10-12 17:18:37,725 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:37,726 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:37" (2/2) ... [2023-10-12 17:18:37,727 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-incr-decr.bpl [2023-10-12 17:18:37,796 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:18:37,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 68 flow [2023-10-12 17:18:37,838 INFO L124 PetriNetUnfolderBase]: 2/22 cut-off events. [2023-10-12 17:18:37,838 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:18:37,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 2/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2023-10-12 17:18:37,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 68 flow [2023-10-12 17:18:37,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 22 transitions, 56 flow [2023-10-12 17:18:37,849 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:18:37,865 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 22 transitions, 56 flow [2023-10-12 17:18:37,867 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 22 transitions, 56 flow [2023-10-12 17:18:37,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 22 transitions, 56 flow [2023-10-12 17:18:37,887 INFO L124 PetriNetUnfolderBase]: 2/22 cut-off events. [2023-10-12 17:18:37,887 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:18:37,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 2/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2023-10-12 17:18:37,888 INFO L119 LiptonReduction]: Number of co-enabled transitions 96 [2023-10-12 17:18:38,099 INFO L134 LiptonReduction]: Checked pairs total: 63 [2023-10-12 17:18:38,099 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:18:38,110 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:18:38,110 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:18:38,110 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:18:38,110 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:18:38,111 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:18:38,111 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:18:38,111 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:18:38,111 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:18:38,112 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 13 transitions, 38 flow [2023-10-12 17:18:38,115 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:38,115 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:18:38,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:38,115 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:38,118 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:18:38,118 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 13 transitions, 38 flow [2023-10-12 17:18:38,119 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:38,120 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:18:38,120 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:38,120 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:38,124 INFO L748 eck$LassoCheckResult]: Stem: 33#[$Ultimate##0]true [79] $Ultimate##0-->L20: Formula: (and (= (select v_A_31 v_k_9) v_ULTIMATE.start_x_8) (< v_k_9 v_N_16) (<= 0 v_k_9) (= v_A_31 v_B_2)) InVars {A=v_A_31, N=v_N_16, k=v_k_9} OutVars{A=v_A_31, N=v_N_16, k=v_k_9, ULTIMATE.start_x=v_ULTIMATE.start_x_8, B=v_B_2} AuxVars[] AssignedVars[ULTIMATE.start_x, B] 35#[L20]true [66] L20-->$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] 37#[$Ultimate##0, L20-1]true [52] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 39#[L34-1, L20-1]true [2023-10-12 17:18:38,124 INFO L750 eck$LassoCheckResult]: Loop: 39#[L34-1, L20-1]true [80] L34-1-->L34-1: Formula: (and (= v_thread1Thread1of1ForFork0_i_23 (+ v_thread1Thread1of1ForFork0_i_24 1)) (< v_thread1Thread1of1ForFork0_i_24 v_N_20) (= v_A_39 (store v_A_40 v_thread1Thread1of1ForFork0_i_24 (+ (select v_A_40 v_thread1Thread1of1ForFork0_i_24) 1)))) InVars {A=v_A_40, N=v_N_20, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_24} OutVars{A=v_A_39, N=v_N_20, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_23} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork0_i] 39#[L34-1, L20-1]true [2023-10-12 17:18:38,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:38,128 INFO L85 PathProgramCache]: Analyzing trace with hash 107808, now seen corresponding path program 1 times [2023-10-12 17:18:38,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:38,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885587443] [2023-10-12 17:18:38,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:38,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:38,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:38,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:38,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:38,259 INFO L85 PathProgramCache]: Analyzing trace with hash 111, now seen corresponding path program 1 times [2023-10-12 17:18:38,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:38,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137852215] [2023-10-12 17:18:38,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:38,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:38,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:38,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:38,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:38,274 INFO L85 PathProgramCache]: Analyzing trace with hash 3342128, now seen corresponding path program 1 times [2023-10-12 17:18:38,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:38,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210298989] [2023-10-12 17:18:38,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:38,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:38,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:38,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:38,385 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:38,386 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:38,386 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:38,386 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:38,386 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:38,386 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:38,386 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:38,386 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:38,386 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-incr-decr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:18:38,387 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:38,387 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:38,400 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:18:38,449 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:18:38,516 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:38,519 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:38,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:38,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:38,527 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:18:38,536 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:18:38,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:38,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:38,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:38,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:38,548 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:18:38,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:38,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:38,564 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:38,578 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:18:38,579 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:18:38,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:38,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:38,581 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:18:38,582 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:18:38,584 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:38,592 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:18:38,593 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:38,594 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2023-10-12 17:18:38,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:18:38,599 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:38,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:38,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:38,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:38,650 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:18:38,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:38,651 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:18:38,684 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:18:38,686 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:18:38,781 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. 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) Result 5 states and 204 transitions. [2023-10-12 17:18:38,783 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:38,786 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:38,788 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:18:38,793 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:18:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2023-10-12 17:18:38,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:18:38,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:38,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:18:38,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:38,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:18:38,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:38,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 144 transitions, 708 flow [2023-10-12 17:18:38,839 INFO L124 PetriNetUnfolderBase]: 55/106 cut-off events. [2023-10-12 17:18:38,839 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-10-12 17:18:38,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 106 events. 55/106 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 288 event pairs, 1 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 164. Up to 33 conditions per place. [2023-10-12 17:18:38,841 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 28 places, 144 transitions, 708 flow [2023-10-12 17:18:38,848 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 28 places, 144 transitions, 708 flow [2023-10-12 17:18:38,848 INFO L430 stractBuchiCegarLoop]: Abstraction has has 28 places, 144 transitions, 708 flow [2023-10-12 17:18:38,849 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:18:38,849 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 places, 144 transitions, 708 flow [2023-10-12 17:18:38,861 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:38,861 INFO L124 PetriNetUnfolderBase]: 23/40 cut-off events. [2023-10-12 17:18:38,862 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:18:38,862 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:38,863 INFO L748 eck$LassoCheckResult]: Stem: 33#[$Ultimate##0]true [79] $Ultimate##0-->L20: Formula: (and (= (select v_A_31 v_k_9) v_ULTIMATE.start_x_8) (< v_k_9 v_N_16) (<= 0 v_k_9) (= v_A_31 v_B_2)) InVars {A=v_A_31, N=v_N_16, k=v_k_9} OutVars{A=v_A_31, N=v_N_16, k=v_k_9, ULTIMATE.start_x=v_ULTIMATE.start_x_8, B=v_B_2} AuxVars[] AssignedVars[ULTIMATE.start_x, B] 35#[L20]true [66] L20-->$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] 37#[$Ultimate##0, L20-1]true [69] L20-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 88#[$Ultimate##0, $Ultimate##0, L21]true [52] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 90#[L34-1, $Ultimate##0, L21]true [58] $Ultimate##0-->L47-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 92#[L34-1, L21, L47-1]true [78] L47-1-->L47-1: Formula: (and (= (+ v_thread2Thread1of1ForFork1_i_24 1) v_thread2Thread1of1ForFork1_i_23) (< v_thread2Thread1of1ForFork1_i_24 v_N_14) (= v_A_27 (store v_A_28 v_thread2Thread1of1ForFork1_i_24 (+ (- 1) (select v_A_28 v_thread2Thread1of1ForFork1_i_24))))) InVars {A=v_A_28, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_24, N=v_N_14} OutVars{A=v_A_27, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_23, N=v_N_14} AuxVars[] AssignedVars[A, thread2Thread1of1ForFork1_i] 92#[L34-1, L21, L47-1]true [2023-10-12 17:18:38,863 INFO L750 eck$LassoCheckResult]: Loop: 92#[L34-1, L21, L47-1]true [78] L47-1-->L47-1: Formula: (and (= (+ v_thread2Thread1of1ForFork1_i_24 1) v_thread2Thread1of1ForFork1_i_23) (< v_thread2Thread1of1ForFork1_i_24 v_N_14) (= v_A_27 (store v_A_28 v_thread2Thread1of1ForFork1_i_24 (+ (- 1) (select v_A_28 v_thread2Thread1of1ForFork1_i_24))))) InVars {A=v_A_28, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_24, N=v_N_14} OutVars{A=v_A_27, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_23, N=v_N_14} AuxVars[] AssignedVars[A, thread2Thread1of1ForFork1_i] 92#[L34-1, L21, L47-1]true [78] L47-1-->L47-1: Formula: (and (= (+ v_thread2Thread1of1ForFork1_i_24 1) v_thread2Thread1of1ForFork1_i_23) (< v_thread2Thread1of1ForFork1_i_24 v_N_14) (= v_A_27 (store v_A_28 v_thread2Thread1of1ForFork1_i_24 (+ (- 1) (select v_A_28 v_thread2Thread1of1ForFork1_i_24))))) InVars {A=v_A_28, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_24, N=v_N_14} OutVars{A=v_A_27, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_23, N=v_N_14} AuxVars[] AssignedVars[A, thread2Thread1of1ForFork1_i] 92#[L34-1, L21, L47-1]true [2023-10-12 17:18:38,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:38,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1082700873, now seen corresponding path program 1 times [2023-10-12 17:18:38,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:38,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454393261] [2023-10-12 17:18:38,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:38,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:38,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:38,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:38,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:38,904 INFO L85 PathProgramCache]: Analyzing trace with hash 3457, now seen corresponding path program 1 times [2023-10-12 17:18:38,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:38,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339604124] [2023-10-12 17:18:38,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:38,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:38,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:38,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:38,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:38,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1093450825, now seen corresponding path program 2 times [2023-10-12 17:18:38,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:38,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468741317] [2023-10-12 17:18:38,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:38,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:38,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:38,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:39,107 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:39,107 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:39,107 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:39,107 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:39,108 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:39,108 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:39,108 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:39,108 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:39,108 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-incr-decr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:18:39,108 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:39,108 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:39,110 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:18:39,113 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:39,195 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:39,198 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:18:39,201 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:18:39,320 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:39,320 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:39,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:39,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:39,322 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:18:39,330 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:18:39,332 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:18:39,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:39,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:39,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:39,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:39,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:39,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:39,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:39,355 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:18:39,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:39,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:39,359 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:18:39,360 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:18:39,361 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:18:39,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:39,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:39,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:39,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:39,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:39,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:39,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:39,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:39,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:39,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:39,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:39,394 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:18:39,404 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:18:39,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:39,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:39,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:39,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:39,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:39,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:39,431 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:18:39,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:39,440 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:18:39,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:39,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:39,442 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:18:39,449 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:18:39,452 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:18:39,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:39,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:39,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:39,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:39,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:39,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:39,481 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:39,504 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:18:39,505 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:18:39,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:39,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:39,793 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forcibly destroying the process [2023-10-12 17:18:39,793 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:18:39,794 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:18:39,796 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:18:39,797 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:39,821 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:18:39,821 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:39,821 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 1*N Supporting invariants [] [2023-10-12 17:18:39,829 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:18:39,832 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:18:39,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:39,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:39,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:39,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:18:39,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:39,884 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:18:39,884 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:40,016 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 270 transitions. [2023-10-12 17:18:40,017 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:40,041 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:18:40,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2023-10-12 17:18:40,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:18:40,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:40,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:18:40,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:40,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:18:40,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:40,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 2088 transitions, 14424 flow [2023-10-12 17:18:40,129 INFO L124 PetriNetUnfolderBase]: 164/314 cut-off events. [2023-10-12 17:18:40,129 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-10-12 17:18:40,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 314 events. 164/314 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1296 event pairs, 1 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 747. Up to 110 conditions per place. [2023-10-12 17:18:40,131 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 42 places, 2088 transitions, 14424 flow [2023-10-12 17:18:40,156 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 42 places, 2088 transitions, 14424 flow [2023-10-12 17:18:40,156 INFO L430 stractBuchiCegarLoop]: Abstraction has has 42 places, 2088 transitions, 14424 flow [2023-10-12 17:18:40,156 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:18:40,156 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 places, 2088 transitions, 14424 flow [2023-10-12 17:18:40,211 INFO L124 PetriNetUnfolderBase]: 164/314 cut-off events. [2023-10-12 17:18:40,211 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-10-12 17:18:40,211 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:18:40,217 INFO L201 PluginConnector]: Adding new model map-incr-decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:18:40 BoogieIcfgContainer [2023-10-12 17:18:40,217 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:18:40,218 INFO L158 Benchmark]: Toolchain (without parser) took 2767.40ms. Allocated memory was 175.1MB in the beginning and 248.5MB in the end (delta: 73.4MB). Free memory was 128.6MB in the beginning and 164.6MB in the end (delta: -36.0MB). Peak memory consumption was 37.9MB. Max. memory is 8.0GB. [2023-10-12 17:18:40,218 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 175.1MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:18:40,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.74ms. Allocated memory is still 175.1MB. Free memory was 128.6MB in the beginning and 127.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:18:40,219 INFO L158 Benchmark]: Boogie Preprocessor took 18.45ms. Allocated memory is still 175.1MB. Free memory was 127.0MB in the beginning and 126.0MB in the end (delta: 988.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:18:40,219 INFO L158 Benchmark]: RCFGBuilder took 208.98ms. Allocated memory is still 175.1MB. Free memory was 125.9MB in the beginning and 116.9MB in the end (delta: 9.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:18:40,220 INFO L158 Benchmark]: BuchiAutomizer took 2510.40ms. Allocated memory was 175.1MB in the beginning and 248.5MB in the end (delta: 73.4MB). Free memory was 116.7MB in the beginning and 164.6MB in the end (delta: -47.9MB). Peak memory consumption was 26.3MB. Max. memory is 8.0GB. [2023-10-12 17:18:40,221 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.27ms. Allocated memory is still 175.1MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.74ms. Allocated memory is still 175.1MB. Free memory was 128.6MB in the beginning and 127.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.45ms. Allocated memory is still 175.1MB. Free memory was 127.0MB in the beginning and 126.0MB in the end (delta: 988.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 208.98ms. Allocated memory is still 175.1MB. Free memory was 125.9MB in the beginning and 116.9MB in the end (delta: 9.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2510.40ms. Allocated memory was 175.1MB in the beginning and 248.5MB in the end (delta: 73.4MB). Free memory was 116.7MB in the beginning and 164.6MB in the end (delta: -47.9MB). Peak memory consumption was 26.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 2 terminating modules (0 trivial, 2 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 -1 * i + N and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 145 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 89 mSDtfsCounter, 167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital59 mio100 ax100 hnf100 lsp88 ukn65 mio100 lsp62 div100 bol100 ite100 ukn100 eq166 hnf91 smp100 dnf100 smp100 tf102 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 73ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - 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.2s, 27 PlacesBefore, 18 PlacesAfterwards, 22 TransitionsBefore, 13 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 63 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 50, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 50, unknown conditional: 0, unknown unconditional: 50] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, 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:18:40,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:18:40,436 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...