/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_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_TwoOne_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:12:11,439 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:12:11,501 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:12:11,537 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:12:11,538 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:12:11,538 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:12:11,539 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:12:11,540 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:12:11,540 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:12:11,544 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:12:11,544 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:12:11,544 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:12:11,544 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:12:11,545 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:12:11,546 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:12:11,546 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:12:11,546 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:12:11,547 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:12:11,547 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:12:11,547 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:12:11,547 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:12:11,548 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:12:11,549 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:12:11,549 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:12:11,549 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:12:11,549 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:12:11,550 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:12:11,550 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:12:11,550 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:12:11,550 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:12:11,551 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:12:11,551 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:12:11,551 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:12:11,553 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:12:11,553 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_AUTOMATON [2023-10-12 17:12:11,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:12:11,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:12:11,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:12:11,781 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:12:11,782 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:12:11,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_TwoOne_nonterminating.bpl [2023-10-12 17:12:11,783 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_TwoOne_nonterminating.bpl' [2023-10-12 17:12:11,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:12:11,803 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:12:11,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:11,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:12:11,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:12:11,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:11" (1/1) ... [2023-10-12 17:12:11,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:11" (1/1) ... [2023-10-12 17:12:11,829 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:12:11,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:11,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:12:11,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:12:11,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:12:11,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:11" (1/1) ... [2023-10-12 17:12:11,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:11" (1/1) ... [2023-10-12 17:12:11,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:11" (1/1) ... [2023-10-12 17:12:11,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:11" (1/1) ... [2023-10-12 17:12:11,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:11" (1/1) ... [2023-10-12 17:12:11,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:11" (1/1) ... [2023-10-12 17:12:11,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:11" (1/1) ... [2023-10-12 17:12:11,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:11" (1/1) ... [2023-10-12 17:12:11,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:12:11,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:12:11,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:12:11,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:12:11,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:11" (1/1) ... [2023-10-12 17:12:11,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,887 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:12:11,910 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:12:11,924 INFO L124 BoogieDeclarations]: Specification and implementation of procedure once given in one single declaration [2023-10-12 17:12:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure once [2023-10-12 17:12:11,924 INFO L138 BoogieDeclarations]: Found implementation of procedure once [2023-10-12 17:12:11,925 INFO L124 BoogieDeclarations]: Specification and implementation of procedure double given in one single declaration [2023-10-12 17:12:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure double [2023-10-12 17:12:11,925 INFO L138 BoogieDeclarations]: Found implementation of procedure double [2023-10-12 17:12:11,925 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:12:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:12:11,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:12:11,926 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:12:11,962 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:12:11,964 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:12:12,016 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:12:12,021 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:12:12,021 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:12:12,023 INFO L201 PluginConnector]: Adding new model concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:12 BoogieIcfgContainer [2023-10-12 17:12:12,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:12:12,024 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:12:12,024 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:12:12,027 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:12:12,027 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:12,028 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:11" (1/2) ... [2023-10-12 17:12:12,029 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@541b7ec6 and model type concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:12:12, skipping insertion in model container [2023-10-12 17:12:12,029 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:12,029 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:12" (2/2) ... [2023-10-12 17:12:12,030 INFO L332 chiAutomizerObserver]: Analyzing ICFG concurrent_TwoOne_nonterminating.bpl [2023-10-12 17:12:12,076 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:12:12,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 20 transitions, 62 flow [2023-10-12 17:12:12,112 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-10-12 17:12:12,112 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:12:12,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 3/16 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2023-10-12 17:12:12,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 20 transitions, 62 flow [2023-10-12 17:12:12,118 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 16 transitions, 50 flow [2023-10-12 17:12:12,121 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:12:12,132 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 16 transitions, 50 flow [2023-10-12 17:12:12,134 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 16 transitions, 50 flow [2023-10-12 17:12:12,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 50 flow [2023-10-12 17:12:12,140 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-10-12 17:12:12,140 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:12:12,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 3/16 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2023-10-12 17:12:12,141 INFO L119 LiptonReduction]: Number of co-enabled transitions 56 [2023-10-12 17:12:12,257 INFO L134 LiptonReduction]: Checked pairs total: 77 [2023-10-12 17:12:12,258 INFO L136 LiptonReduction]: Total number of compositions: 3 [2023-10-12 17:12:12,274 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:12:12,275 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:12:12,275 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:12:12,275 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:12:12,275 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:12:12,275 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:12:12,275 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:12:12,275 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:12:12,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:12:12,298 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 9 [2023-10-12 17:12:12,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:12,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:12,302 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:12:12,302 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:12,302 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:12:12,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 16 states, but on-demand construction may add more states [2023-10-12 17:12:12,304 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 9 [2023-10-12 17:12:12,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:12,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:12,304 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:12:12,309 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:12,313 INFO L748 eck$LassoCheckResult]: Stem: 24#[$Ultimate##0]don't care [32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x] 27#[L8]don't care [47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0] 29#[L8-1, L17]don't care [2023-10-12 17:12:12,314 INFO L750 eck$LassoCheckResult]: Loop: 29#[L8-1, L17]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 29#[L8-1, L17]don't care [2023-10-12 17:12:12,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2000, now seen corresponding path program 1 times [2023-10-12 17:12:12,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638391817] [2023-10-12 17:12:12,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,433 INFO L85 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 1 times [2023-10-12 17:12:12,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744930095] [2023-10-12 17:12:12,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,450 INFO L85 PathProgramCache]: Analyzing trace with hash 62054, now seen corresponding path program 1 times [2023-10-12 17:12:12,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210919607] [2023-10-12 17:12:12,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,523 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:12,524 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:12,524 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:12,524 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:12,524 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:12,524 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,524 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:12,524 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:12,524 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:12:12,525 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:12,525 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:12,535 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:12:12,567 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:12,567 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:12,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,572 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:12:12,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:12,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:12,580 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:12:12,591 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:12:12,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,593 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:12:12,595 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:12:12,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:12,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:12,669 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:12,672 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:12:12,672 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:12,673 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:12,673 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:12,673 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:12,673 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:12,673 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,673 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:12,673 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:12,673 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:12:12,673 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:12,673 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:12,674 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:12:12,694 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:12,698 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:12,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,700 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:12:12,709 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:12:12,723 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:12:12,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:12,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:12,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:12,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:12,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:12,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:12,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:12,749 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:12,754 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:12,754 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:12:12,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,761 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:12:12,985 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:12,985 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:12,986 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:12,986 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 7 Supporting invariants [] [2023-10-12 17:12:12,988 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:12:12,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:12:12,994 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:13,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:13,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:13,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:13,031 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:13,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:13,032 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:12:13,061 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:12:13,063 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 16 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:13,128 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 16 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 57 states and 118 transitions. Complement of second has 5 states. [2023-10-12 17:12:13,130 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:12:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2023-10-12 17:12:13,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:12:13,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:13,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:12:13,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:13,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:12:13,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:13,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 118 transitions. [2023-10-12 17:12:13,147 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 8 [2023-10-12 17:12:13,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 27 states and 57 transitions. [2023-10-12 17:12:13,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-10-12 17:12:13,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2023-10-12 17:12:13,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 57 transitions. [2023-10-12 17:12:13,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:13,152 INFO L219 hiAutomatonCegarLoop]: Abstraction has 27 states and 57 transitions. [2023-10-12 17:12:13,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 57 transitions. [2023-10-12 17:12:13,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2023-10-12 17:12:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 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:12:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 41 transitions. [2023-10-12 17:12:13,179 INFO L241 hiAutomatonCegarLoop]: Abstraction has 19 states and 41 transitions. [2023-10-12 17:12:13,179 INFO L430 stractBuchiCegarLoop]: Abstraction has 19 states and 41 transitions. [2023-10-12 17:12:13,179 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:12:13,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 41 transitions. [2023-10-12 17:12:13,181 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 8 [2023-10-12 17:12:13,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:13,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:13,182 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:12:13,182 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:12:13,183 INFO L748 eck$LassoCheckResult]: Stem: 172#[$Ultimate##0]don't care [32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x] 174#[L8]don't care [47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0] 156#[L8-1, L17]don't care [53] L17-->doubleEXIT: Formula: (<= 4 v_x_22) InVars {x=v_x_22} OutVars{x=v_x_22} AuxVars[] AssignedVars[] 158#[L8-1, doubleEXIT]don't care [44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0] 148#[L9, doubleEXIT, L25]don't care [2023-10-12 17:12:13,183 INFO L750 eck$LassoCheckResult]: Loop: 148#[L9, doubleEXIT, L25]don't care [35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 152#[doubleEXIT, L26, L9]don't care [37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 148#[L9, doubleEXIT, L25]don't care [2023-10-12 17:12:13,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:13,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1923687, now seen corresponding path program 1 times [2023-10-12 17:12:13,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:13,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155325738] [2023-10-12 17:12:13,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:13,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:13,229 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:12:13,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:13,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155325738] [2023-10-12 17:12:13,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155325738] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:13,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:13,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:12:13,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132431201] [2023-10-12 17:12:13,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:13,232 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:13,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:13,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2083, now seen corresponding path program 1 times [2023-10-12 17:12:13,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:13,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016109703] [2023-10-12 17:12:13,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:13,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:13,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:13,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:13,251 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:13,252 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:13,252 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:13,252 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:13,252 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:13,252 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:13,252 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:13,252 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:13,252 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:12:13,252 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:13,252 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:13,253 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:12:13,271 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:13,271 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:13,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:13,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:13,273 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:12:13,275 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:12:13,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:13,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:13,354 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:12:13,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:13,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:13,356 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:12:13,357 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:12:13,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:13,360 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:13,376 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:13,380 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:12:13,380 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:13,380 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:13,380 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:13,380 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:13,380 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:13,380 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:13,380 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:13,380 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:13,380 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:12:13,380 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:13,381 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:13,381 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:12:13,413 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:13,413 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:13,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:13,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:13,414 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:12:13,416 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:12:13,417 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:12:13,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:13,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:13,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:13,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:13,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:13,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:13,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:13,432 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:13,434 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:12:13,434 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:12:13,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:13,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:13,441 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:12:13,442 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:12:13,485 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:13,486 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:13,486 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:13,486 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2023-10-12 17:12:13,488 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:12:13,494 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:13,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:13,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:13,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:13,530 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:13,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:13,562 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:12:13,563 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:12:13,564 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 41 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:13,626 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 41 transitions. cyclomatic complexity: 30. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 115 transitions. Complement of second has 9 states. [2023-10-12 17:12:13,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2023-10-12 17:12:13,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:12:13,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:13,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:12:13,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:13,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:12:13,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:13,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 115 transitions. [2023-10-12 17:12:13,639 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 9 [2023-10-12 17:12:13,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 30 states and 62 transitions. [2023-10-12 17:12:13,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-10-12 17:12:13,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-10-12 17:12:13,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 62 transitions. [2023-10-12 17:12:13,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:13,644 INFO L219 hiAutomatonCegarLoop]: Abstraction has 30 states and 62 transitions. [2023-10-12 17:12:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 62 transitions. [2023-10-12 17:12:13,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2023-10-12 17:12:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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:12:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2023-10-12 17:12:13,647 INFO L241 hiAutomatonCegarLoop]: Abstraction has 25 states and 52 transitions. [2023-10-12 17:12:13,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:13,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:12:13,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:12:13,650 INFO L87 Difference]: Start difference. First operand 25 states and 52 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:13,670 INFO L93 Difference]: Finished difference Result 30 states and 52 transitions. [2023-10-12 17:12:13,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 52 transitions. [2023-10-12 17:12:13,673 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2023-10-12 17:12:13,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 23 states and 39 transitions. [2023-10-12 17:12:13,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-10-12 17:12:13,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2023-10-12 17:12:13,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 39 transitions. [2023-10-12 17:12:13,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:13,674 INFO L219 hiAutomatonCegarLoop]: Abstraction has 23 states and 39 transitions. [2023-10-12 17:12:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 39 transitions. [2023-10-12 17:12:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2023-10-12 17:12:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 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:12:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2023-10-12 17:12:13,679 INFO L241 hiAutomatonCegarLoop]: Abstraction has 16 states and 28 transitions. [2023-10-12 17:12:13,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:12:13,681 INFO L430 stractBuchiCegarLoop]: Abstraction has 16 states and 28 transitions. [2023-10-12 17:12:13,681 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:12:13,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 28 transitions. [2023-10-12 17:12:13,682 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2023-10-12 17:12:13,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:13,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:13,683 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:12:13,683 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-10-12 17:12:13,684 INFO L748 eck$LassoCheckResult]: Stem: 380#[$Ultimate##0]don't care [32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x] 382#[L8]don't care [47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0] 366#[L8-1, L17]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 368#[L8-1, L17]don't care [44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0] 374#[L9, L17, L25]don't care [35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 376#[L17, L26, L9]don't care [37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 384#[L9, L17, L25]don't care [2023-10-12 17:12:13,684 INFO L750 eck$LassoCheckResult]: Loop: 384#[L9, L17, L25]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 390#[L9, L17, L25]don't care [35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 392#[L17, L26, L9]don't care [37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 384#[L9, L17, L25]don't care [2023-10-12 17:12:13,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1848694120, now seen corresponding path program 1 times [2023-10-12 17:12:13,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:13,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822528312] [2023-10-12 17:12:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:13,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:13,721 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:12:13,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:13,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822528312] [2023-10-12 17:12:13,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822528312] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:13,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:13,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:12:13,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064921980] [2023-10-12 17:12:13,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:13,722 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:13,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:13,722 INFO L85 PathProgramCache]: Analyzing trace with hash 82807, now seen corresponding path program 1 times [2023-10-12 17:12:13,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:13,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121112751] [2023-10-12 17:12:13,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:13,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:13,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:13,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:13,751 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:13,751 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:13,751 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:13,751 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:13,752 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:13,752 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:13,752 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:13,752 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:13,752 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:12:13,752 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:13,764 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:13,765 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:13,777 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:12:13,781 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:12:13,792 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:13,793 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:13,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:13,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:13,794 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:12:13,804 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:12:13,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:13,804 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:13,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:12:13,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:13,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:13,821 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:12:13,834 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:13,835 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:13,846 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:12:13,856 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:13,862 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:12:13,863 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:13,863 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:13,863 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:13,863 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:13,864 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:13,864 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:13,864 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:13,864 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:13,864 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_TwoOne_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:12:13,864 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:13,864 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:13,865 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:12:13,889 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:13,889 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:13,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:13,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:13,891 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:12:13,902 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:12:13,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:13,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:13,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:13,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:13,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:13,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:13,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:13,919 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:12:13,928 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:13,934 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:13,934 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:12:13,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:13,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:13,935 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:13,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:12:13,938 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:13,938 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:13,938 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:13,939 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2023-10-12 17:12:13,943 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:12:13,943 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:13,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:13,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:13,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:13,980 WARN L260 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:12:13,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:14,001 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:12:14,003 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-10-12 17:12:14,003 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 28 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:14,053 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 28 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 57 transitions. Complement of second has 11 states. [2023-10-12 17:12:14,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:14,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2023-10-12 17:12:14,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 6 letters. Loop has 3 letters. [2023-10-12 17:12:14,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:14,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 3 letters. [2023-10-12 17:12:14,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:14,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 6 letters. Loop has 6 letters. [2023-10-12 17:12:14,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:14,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 57 transitions. [2023-10-12 17:12:14,059 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2023-10-12 17:12:14,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 28 states and 50 transitions. [2023-10-12 17:12:14,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-10-12 17:12:14,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-10-12 17:12:14,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 50 transitions. [2023-10-12 17:12:14,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:14,060 INFO L219 hiAutomatonCegarLoop]: Abstraction has 28 states and 50 transitions. [2023-10-12 17:12:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 50 transitions. [2023-10-12 17:12:14,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2023-10-12 17:12:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 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:12:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2023-10-12 17:12:14,072 INFO L241 hiAutomatonCegarLoop]: Abstraction has 22 states and 41 transitions. [2023-10-12 17:12:14,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:14,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:12:14,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:12:14,073 INFO L87 Difference]: Start difference. First operand 22 states and 41 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:14,094 INFO L93 Difference]: Finished difference Result 28 states and 46 transitions. [2023-10-12 17:12:14,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 46 transitions. [2023-10-12 17:12:14,095 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-10-12 17:12:14,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 44 transitions. [2023-10-12 17:12:14,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-10-12 17:12:14,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-10-12 17:12:14,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 44 transitions. [2023-10-12 17:12:14,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:14,096 INFO L219 hiAutomatonCegarLoop]: Abstraction has 26 states and 44 transitions. [2023-10-12 17:12:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 44 transitions. [2023-10-12 17:12:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2023-10-12 17:12:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 states have internal predecessors, (33), 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:12:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2023-10-12 17:12:14,098 INFO L241 hiAutomatonCegarLoop]: Abstraction has 19 states and 33 transitions. [2023-10-12 17:12:14,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:12:14,099 INFO L430 stractBuchiCegarLoop]: Abstraction has 19 states and 33 transitions. [2023-10-12 17:12:14,099 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:12:14,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 33 transitions. [2023-10-12 17:12:14,099 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-10-12 17:12:14,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:14,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:14,100 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2023-10-12 17:12:14,100 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2023-10-12 17:12:14,100 INFO L748 eck$LassoCheckResult]: Stem: 574#[$Ultimate##0]don't care [32] $Ultimate##0-->L8: Formula: (= v_x_8 1) InVars {} OutVars{x=v_x_8} AuxVars[] AssignedVars[x] 576#[L8]don't care [47] L8-->L17: Formula: (= v_doubleThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{doubleThread1of1ForFork1_thidvar0=v_doubleThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[doubleThread1of1ForFork1_thidvar0] 560#[L8-1, L17]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 562#[L8-1, L17]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 566#[L8-1, L17]don't care [44] L8-1-->L25: Formula: (= v_onceThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork0_thidvar0=v_onceThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork0_thidvar0] 592#[L9, L17, L25]don't care [35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 578#[L17, L26, L9]don't care [37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 570#[L9, L17, L25]don't care [2023-10-12 17:12:14,100 INFO L750 eck$LassoCheckResult]: Loop: 570#[L9, L17, L25]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 572#[L9, L17, L25]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 588#[L9, L17, L25]don't care [35] L25-->L26: Formula: (= 3 v_x_1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 590#[L17, L26, L9]don't care [37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 570#[L9, L17, L25]don't care [2023-10-12 17:12:14,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:14,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1475249406, now seen corresponding path program 2 times [2023-10-12 17:12:14,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:14,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036017580] [2023-10-12 17:12:14,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:14,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:14,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:14,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:14,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:14,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2585251, now seen corresponding path program 2 times [2023-10-12 17:12:14,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:14,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484641220] [2023-10-12 17:12:14,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:14,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:14,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:14,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:14,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:14,118 INFO L85 PathProgramCache]: Analyzing trace with hash 52506912, now seen corresponding path program 3 times [2023-10-12 17:12:14,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:14,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446071578] [2023-10-12 17:12:14,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:14,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:14,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:14,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:14,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:14,230 INFO L201 PluginConnector]: Adding new model concurrent_TwoOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:12:14 BoogieIcfgContainer [2023-10-12 17:12:14,230 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:12:14,231 INFO L158 Benchmark]: Toolchain (without parser) took 2427.46ms. Allocated memory was 194.0MB in the beginning and 284.2MB in the end (delta: 90.2MB). Free memory was 148.2MB in the beginning and 227.9MB in the end (delta: -79.7MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2023-10-12 17:12:14,231 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 194.0MB. Free memory was 149.2MB in the beginning and 149.0MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:14,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.17ms. Allocated memory is still 194.0MB. Free memory was 148.2MB in the beginning and 146.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:14,232 INFO L158 Benchmark]: Boogie Preprocessor took 14.70ms. Allocated memory is still 194.0MB. Free memory was 146.6MB in the beginning and 145.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:14,232 INFO L158 Benchmark]: RCFGBuilder took 172.88ms. Allocated memory is still 194.0MB. Free memory was 145.4MB in the beginning and 137.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-10-12 17:12:14,233 INFO L158 Benchmark]: BuchiAutomizer took 2206.31ms. Allocated memory was 194.0MB in the beginning and 284.2MB in the end (delta: 90.2MB). Free memory was 136.8MB in the beginning and 227.9MB in the end (delta: -91.0MB). Peak memory consumption was 345.6kB. Max. memory is 8.0GB. [2023-10-12 17:12:14,235 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 194.0MB. Free memory was 149.2MB in the beginning and 149.0MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.17ms. Allocated memory is still 194.0MB. Free memory was 148.2MB in the beginning and 146.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.70ms. Allocated memory is still 194.0MB. Free memory was 146.6MB in the beginning and 145.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 172.88ms. Allocated memory is still 194.0MB. Free memory was 145.4MB in the beginning and 137.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2206.31ms. Allocated memory was 194.0MB in the beginning and 284.2MB in the end (delta: 90.2MB). Free memory was 136.8MB in the beginning and 227.9MB in the end (delta: -91.0MB). Peak memory consumption was 345.6kB. 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 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 7 + -2 * x and consists of 3 locations. One deterministic module has affine ranking function x and consists of 5 locations. One deterministic module has affine ranking function x and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 33 StatesRemovedByMinimization, 5 NontrivialMinimizations. 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, 51 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 15 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq186 hnf89 smp100 dnf100 smp100 tf113 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 287ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 double(); VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L9] FORK 0 fork 2 once(); VAL [x=3] [L25] COND TRUE 2 x == 3 VAL [x=3] [L26] 2 x := 1; VAL [x=1] Loop: [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L25] COND TRUE x == 3 [L26] x := 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 double(); VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L9] FORK 0 fork 2 once(); VAL [x=3] [L25] COND TRUE 2 x == 3 VAL [x=3] [L26] 2 x := 1; VAL [x=1] Loop: [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L25] COND TRUE x == 3 [L26] x := 1; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 19 PlacesBefore, 16 PlacesAfterwards, 16 TransitionsBefore, 13 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 77 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 41, unknown conditional: 0, unknown unconditional: 41] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 10, Positive conditional cache size: 0, Positive unconditional cache size: 10, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:12:14,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:14,460 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...