/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_ThreeThreadsAlternating_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:12:09,301 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:12:09,356 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:09,378 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:12:09,378 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:12:09,379 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:12:09,380 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:12:09,380 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:12:09,380 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:12:09,383 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:12:09,383 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:12:09,383 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:12:09,383 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:12:09,384 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:12:09,385 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:12:09,385 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:12:09,385 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:12:09,385 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:12:09,385 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:12:09,385 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:12:09,386 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:12:09,386 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:12:09,386 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:12:09,386 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:12:09,386 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:12:09,386 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:12:09,386 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:12:09,387 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:12:09,387 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:12:09,387 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:12:09,388 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:12:09,388 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:12:09,388 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:12:09,389 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:12:09,389 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:09,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:12:09,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:12:09,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:12:09,594 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:12:09,595 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:12:09,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_ThreeThreadsAlternating_nonterminating.bpl [2023-10-12 17:12:09,596 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_ThreeThreadsAlternating_nonterminating.bpl' [2023-10-12 17:12:09,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:12:09,611 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:12:09,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:09,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:12:09,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:12:09,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,631 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:12:09,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:09,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:12:09,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:12:09,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:12:09,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:12:09,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:12:09,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:12:09,646 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:12:09,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:09,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:09,674 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:09,693 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:09,702 INFO L124 BoogieDeclarations]: Specification and implementation of procedure one given in one single declaration [2023-10-12 17:12:09,702 INFO L130 BoogieDeclarations]: Found specification of procedure one [2023-10-12 17:12:09,702 INFO L138 BoogieDeclarations]: Found implementation of procedure one [2023-10-12 17:12:09,702 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:12:09,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:12:09,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:12:09,702 INFO L124 BoogieDeclarations]: Specification and implementation of procedure three given in one single declaration [2023-10-12 17:12:09,703 INFO L130 BoogieDeclarations]: Found specification of procedure three [2023-10-12 17:12:09,703 INFO L138 BoogieDeclarations]: Found implementation of procedure three [2023-10-12 17:12:09,703 INFO L124 BoogieDeclarations]: Specification and implementation of procedure two given in one single declaration [2023-10-12 17:12:09,703 INFO L130 BoogieDeclarations]: Found specification of procedure two [2023-10-12 17:12:09,703 INFO L138 BoogieDeclarations]: Found implementation of procedure two [2023-10-12 17:12:09,704 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:09,735 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:12:09,737 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:12:09,797 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:12:09,802 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:12:09,802 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:12:09,803 INFO L201 PluginConnector]: Adding new model concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:09 BoogieIcfgContainer [2023-10-12 17:12:09,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:12:09,804 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:12:09,804 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:12:09,842 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:12:09,842 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:09,843 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/2) ... [2023-10-12 17:12:09,845 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f02faf7 and model type concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:12:09, skipping insertion in model container [2023-10-12 17:12:09,845 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:09,845 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:09" (2/2) ... [2023-10-12 17:12:09,846 INFO L332 chiAutomizerObserver]: Analyzing ICFG concurrent_ThreeThreadsAlternating_nonterminating.bpl [2023-10-12 17:12:09,910 INFO L144 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2023-10-12 17:12:09,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 32 transitions, 106 flow [2023-10-12 17:12:09,964 INFO L124 PetriNetUnfolderBase]: 8/29 cut-off events. [2023-10-12 17:12:09,964 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:12:09,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 29 events. 8/29 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 26. Up to 6 conditions per place. [2023-10-12 17:12:09,968 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 32 transitions, 106 flow [2023-10-12 17:12:09,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 26 transitions, 88 flow [2023-10-12 17:12:09,979 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:12:09,993 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 26 transitions, 88 flow [2023-10-12 17:12:09,995 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 26 transitions, 88 flow [2023-10-12 17:12:09,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 88 flow [2023-10-12 17:12:10,002 INFO L124 PetriNetUnfolderBase]: 8/29 cut-off events. [2023-10-12 17:12:10,002 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:12:10,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 29 events. 8/29 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 26. Up to 6 conditions per place. [2023-10-12 17:12:10,004 INFO L119 LiptonReduction]: Number of co-enabled transitions 216 [2023-10-12 17:12:10,057 INFO L134 LiptonReduction]: Checked pairs total: 432 [2023-10-12 17:12:10,057 INFO L136 LiptonReduction]: Total number of compositions: 3 [2023-10-12 17:12:10,089 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:12:10,089 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:12:10,089 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:12:10,089 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:12:10,089 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:12:10,090 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:12:10,090 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:12:10,090 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:12:10,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:12:10,139 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 66 [2023-10-12 17:12:10,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:10,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:10,142 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:12:10,142 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:12:10,142 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:12:10,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 78 states, but on-demand construction may add more states [2023-10-12 17:12:10,149 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 66 [2023-10-12 17:12:10,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:10,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:10,149 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:12:10,149 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:12:10,152 INFO L748 eck$LassoCheckResult]: Stem: 33#[$Ultimate##0]don't care [41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 36#[L8]don't care [63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 38#[L19, L8-1]don't care [2023-10-12 17:12:10,153 INFO L750 eck$LassoCheckResult]: Loop: 38#[L19, L8-1]don't care [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 40#[L20, L8-1]don't care [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 38#[L19, L8-1]don't care [2023-10-12 17:12:10,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2295, now seen corresponding path program 1 times [2023-10-12 17:12:10,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698580947] [2023-10-12 17:12:10,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2023-10-12 17:12:10,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082022131] [2023-10-12 17:12:10,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2207097, now seen corresponding path program 1 times [2023-10-12 17:12:10,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307322842] [2023-10-12 17:12:10,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,267 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:10,267 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:10,267 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:10,267 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:10,268 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:10,268 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,268 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:10,268 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:10,268 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:12:10,268 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:10,268 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:10,277 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:10,312 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:10,313 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:10,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,322 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:10,324 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:10,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:10,326 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:10,337 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:10,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,339 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:10,339 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:10,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:10,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:10,426 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:10,431 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:10,431 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:10,431 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:10,431 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:10,431 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:10,431 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:10,431 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,431 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:10,431 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:10,431 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:12:10,432 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:10,432 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:10,433 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:10,451 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:10,453 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:10,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,455 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:10,458 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:10,478 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:10,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:10,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:10,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:10,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:10,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:10,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:10,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:10,502 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:10,507 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:10,507 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:12:10,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,511 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:10,513 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:10,513 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:10,514 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:10,514 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 3 Supporting invariants [] [2023-10-12 17:12:10,517 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:10,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:10,524 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:10,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:10,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:10,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:10,558 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:10,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:10,579 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:10,597 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:10,598 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 78 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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:10,711 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 78 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 387 states and 1179 transitions. Complement of second has 7 states. [2023-10-12 17:12:10,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2023-10-12 17:12:10,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:12:10,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:10,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:12:10,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:10,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 2 letters. Loop has 4 letters. [2023-10-12 17:12:10,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:10,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 1179 transitions. [2023-10-12 17:12:10,731 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 64 [2023-10-12 17:12:10,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 251 states and 786 transitions. [2023-10-12 17:12:10,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2023-10-12 17:12:10,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 204 [2023-10-12 17:12:10,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 251 states and 786 transitions. [2023-10-12 17:12:10,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:10,741 INFO L219 hiAutomatonCegarLoop]: Abstraction has 251 states and 786 transitions. [2023-10-12 17:12:10,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states and 786 transitions. [2023-10-12 17:12:10,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 131. [2023-10-12 17:12:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 3.16793893129771) internal successors, (415), 130 states have internal predecessors, (415), 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:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 415 transitions. [2023-10-12 17:12:10,776 INFO L241 hiAutomatonCegarLoop]: Abstraction has 131 states and 415 transitions. [2023-10-12 17:12:10,776 INFO L430 stractBuchiCegarLoop]: Abstraction has 131 states and 415 transitions. [2023-10-12 17:12:10,776 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:12:10,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 415 transitions. [2023-10-12 17:12:10,777 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 64 [2023-10-12 17:12:10,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:10,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:10,778 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:12:10,778 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:12:10,778 INFO L748 eck$LassoCheckResult]: Stem: 813#[$Ultimate##0]don't care [41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 695#[L8]don't care [63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 697#[L19, L8-1]don't care [66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 739#[L27, L9, L19]don't care [79] L19-->oneEXIT: Formula: (not (= v_x_14 1)) InVars {x=v_x_14} OutVars{x=v_x_14} AuxVars[] AssignedVars[] 745#[oneEXIT, L27, L9]don't care [2023-10-12 17:12:10,778 INFO L750 eck$LassoCheckResult]: Loop: 745#[oneEXIT, L27, L9]don't care [58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 831#[oneEXIT, L9, L28]don't care [60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 745#[oneEXIT, L27, L9]don't care [2023-10-12 17:12:10,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2207620, now seen corresponding path program 1 times [2023-10-12 17:12:10,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356105902] [2023-10-12 17:12:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:10,818 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:10,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:10,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356105902] [2023-10-12 17:12:10,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356105902] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:10,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:10,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:12:10,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514755609] [2023-10-12 17:12:10,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:10,821 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:10,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2819, now seen corresponding path program 1 times [2023-10-12 17:12:10,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325478955] [2023-10-12 17:12:10,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,845 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:10,846 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:10,846 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:10,846 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:10,846 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:10,846 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,846 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:10,846 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:10,846 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:12:10,846 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:10,846 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:10,848 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:10,864 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:10,864 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:10,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,866 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:10,868 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:10,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:10,869 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:10,891 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:10,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,893 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:10,895 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:10,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:10,897 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:10,919 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:10,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:10,924 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:10,924 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:10,925 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:10,925 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:10,925 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:10,925 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,925 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:10,925 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:10,925 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:12:10,925 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:10,925 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:10,926 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:10,946 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:10,946 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:10,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,948 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:10,950 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:10,952 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:10,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:10,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:10,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:10,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:10,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:10,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:10,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:10,975 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:10,978 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:10,978 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:12:10,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,982 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:10,984 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:10,985 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:10,985 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:10,985 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:10,985 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 5 Supporting invariants [] [2023-10-12 17:12:10,990 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:10,991 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:11,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,021 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,034 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:11,036 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:11,036 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 415 transitions. cyclomatic complexity: 318 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:11,142 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 415 transitions. cyclomatic complexity: 318. 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 283 states and 820 transitions. Complement of second has 9 states. [2023-10-12 17:12:11,143 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:11,144 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:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2023-10-12 17:12:11,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:12:11,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:12:11,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:12:11,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 283 states and 820 transitions. [2023-10-12 17:12:11,148 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:11,160 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 64 [2023-10-12 17:12:11,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:12:11,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 283 states to 216 states and 632 transitions. [2023-10-12 17:12:11,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2023-10-12 17:12:11,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2023-10-12 17:12:11,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 216 states and 632 transitions. [2023-10-12 17:12:11,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,168 INFO L219 hiAutomatonCegarLoop]: Abstraction has 216 states and 632 transitions. [2023-10-12 17:12:11,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 632 transitions. [2023-10-12 17:12:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 154. [2023-10-12 17:12:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 154 states have (on average 3.1233766233766236) internal successors, (481), 153 states have internal predecessors, (481), 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:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 481 transitions. [2023-10-12 17:12:11,180 INFO L241 hiAutomatonCegarLoop]: Abstraction has 154 states and 481 transitions. [2023-10-12 17:12:11,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:11,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:12:11,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:12:11,183 INFO L87 Difference]: Start difference. First operand 154 states and 481 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:11,221 INFO L93 Difference]: Finished difference Result 217 states and 598 transitions. [2023-10-12 17:12:11,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 598 transitions. [2023-10-12 17:12:11,224 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2023-10-12 17:12:11,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 186 states and 505 transitions. [2023-10-12 17:12:11,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2023-10-12 17:12:11,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2023-10-12 17:12:11,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 505 transitions. [2023-10-12 17:12:11,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,226 INFO L219 hiAutomatonCegarLoop]: Abstraction has 186 states and 505 transitions. [2023-10-12 17:12:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 505 transitions. [2023-10-12 17:12:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 164. [2023-10-12 17:12:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 164 states have (on average 2.792682926829268) internal successors, (458), 163 states have internal predecessors, (458), 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:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 458 transitions. [2023-10-12 17:12:11,246 INFO L241 hiAutomatonCegarLoop]: Abstraction has 164 states and 458 transitions. [2023-10-12 17:12:11,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:12:11,247 INFO L430 stractBuchiCegarLoop]: Abstraction has 164 states and 458 transitions. [2023-10-12 17:12:11,247 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:12:11,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 458 transitions. [2023-10-12 17:12:11,250 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 69 [2023-10-12 17:12:11,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:11,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:11,250 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:11,250 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:12:11,250 INFO L748 eck$LassoCheckResult]: Stem: 1915#[$Ultimate##0]don't care [41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 1797#[L8]don't care [63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 1799#[L19, L8-1]don't care [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 1959#[L20, L8-1]don't care [66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 1845#[L27, L20, L9]don't care [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 1999#[L27, L9, L19]don't care [58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 1837#[L28, L9, L19]don't care [60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 1997#[L27, L9, L19]don't care [2023-10-12 17:12:11,250 INFO L750 eck$LassoCheckResult]: Loop: 1997#[L27, L9, L19]don't care [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 1993#[L27, L20, L9]don't care [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 1997#[L27, L9, L19]don't care [2023-10-12 17:12:11,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1327586191, now seen corresponding path program 1 times [2023-10-12 17:12:11,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781485523] [2023-10-12 17:12:11,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:11,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2023-10-12 17:12:11,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883538291] [2023-10-12 17:12:11,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:11,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,265 INFO L85 PathProgramCache]: Analyzing trace with hash 205044241, now seen corresponding path program 2 times [2023-10-12 17:12:11,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047001627] [2023-10-12 17:12:11,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:11,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:11,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047001627] [2023-10-12 17:12:11,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047001627] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:11,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:11,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:12:11,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548239822] [2023-10-12 17:12:11,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:11,315 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:11,316 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:11,316 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:11,316 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:11,316 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:11,316 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,316 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:11,316 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:11,316 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:12:11,316 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:11,316 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:11,316 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:11,331 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:11,332 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:11,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,333 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:11,335 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:11,336 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:11,336 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:11,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:11,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,357 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:11,363 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:11,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:11,364 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:11,385 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:11,389 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:11,389 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:11,389 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:11,389 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:11,389 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:11,389 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:11,389 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,389 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:11,389 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:11,389 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:12:11,389 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:11,390 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:11,390 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:11,415 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:11,416 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:11,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,425 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:11,427 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:11,429 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:11,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:11,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:11,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:11,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:11,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:11,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:11,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:11,444 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:11,446 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:11,446 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:12:11,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,448 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:11,448 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:11,450 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:11,450 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:11,451 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:11,451 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 3 Supporting invariants [] [2023-10-12 17:12:11,453 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:11,453 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:11,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,487 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,496 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:11,497 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:11,497 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 458 transitions. cyclomatic complexity: 327 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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:11,563 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 458 transitions. cyclomatic complexity: 327. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 529 states and 1501 transitions. Complement of second has 7 states. [2023-10-12 17:12:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2023-10-12 17:12:11,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:12:11,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:12:11,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:12:11,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 529 states and 1501 transitions. [2023-10-12 17:12:11,570 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 105 [2023-10-12 17:12:11,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 529 states to 414 states and 1169 transitions. [2023-10-12 17:12:11,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 215 [2023-10-12 17:12:11,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 275 [2023-10-12 17:12:11,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 414 states and 1169 transitions. [2023-10-12 17:12:11,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,575 INFO L219 hiAutomatonCegarLoop]: Abstraction has 414 states and 1169 transitions. [2023-10-12 17:12:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states and 1169 transitions. [2023-10-12 17:12:11,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 229. [2023-10-12 17:12:11,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 229 states have (on average 3.034934497816594) internal successors, (695), 228 states have internal predecessors, (695), 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:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 695 transitions. [2023-10-12 17:12:11,586 INFO L241 hiAutomatonCegarLoop]: Abstraction has 229 states and 695 transitions. [2023-10-12 17:12:11,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:11,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:12:11,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:12:11,586 INFO L87 Difference]: Start difference. First operand 229 states and 695 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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:11,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:11,618 INFO L93 Difference]: Finished difference Result 223 states and 559 transitions. [2023-10-12 17:12:11,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 559 transitions. [2023-10-12 17:12:11,619 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 68 [2023-10-12 17:12:11,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 153 states and 374 transitions. [2023-10-12 17:12:11,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2023-10-12 17:12:11,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2023-10-12 17:12:11,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 374 transitions. [2023-10-12 17:12:11,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,621 INFO L219 hiAutomatonCegarLoop]: Abstraction has 153 states and 374 transitions. [2023-10-12 17:12:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 374 transitions. [2023-10-12 17:12:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 100. [2023-10-12 17:12:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 2.59) internal successors, (259), 99 states have internal predecessors, (259), 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:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 259 transitions. [2023-10-12 17:12:11,623 INFO L241 hiAutomatonCegarLoop]: Abstraction has 100 states and 259 transitions. [2023-10-12 17:12:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:12:11,625 INFO L430 stractBuchiCegarLoop]: Abstraction has 100 states and 259 transitions. [2023-10-12 17:12:11,625 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:12:11,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 259 transitions. [2023-10-12 17:12:11,626 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 49 [2023-10-12 17:12:11,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:11,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:11,627 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:11,627 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-10-12 17:12:11,627 INFO L748 eck$LassoCheckResult]: Stem: 3497#[$Ultimate##0]don't care [41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 3395#[L8]don't care [63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 3397#[L19, L8-1]don't care [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 3405#[L20, L8-1]don't care [66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 3407#[L27, L20, L9]don't care [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 3477#[L27, L9, L19]don't care [69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 3515#[L35, L27, L10, L19]don't care [54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[] 3415#[L27, L10, L19, L36]don't care [2023-10-12 17:12:11,627 INFO L750 eck$LassoCheckResult]: Loop: 3415#[L27, L10, L19, L36]don't care [56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x] 3495#[L35, L27, L10, L19]don't care [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 3337#[L35, L27, L10, L20]don't care [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 3449#[L35, L27, L10, L19]don't care [54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[] 3415#[L27, L10, L19, L36]don't care [2023-10-12 17:12:11,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1327586526, now seen corresponding path program 1 times [2023-10-12 17:12:11,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046607155] [2023-10-12 17:12:11,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,657 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:11,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:11,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046607155] [2023-10-12 17:12:11,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046607155] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:11,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:11,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:12:11,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282611916] [2023-10-12 17:12:11,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:11,658 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:11,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2641533, now seen corresponding path program 1 times [2023-10-12 17:12:11,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865625545] [2023-10-12 17:12:11,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,668 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:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865625545] [2023-10-12 17:12:11,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865625545] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:11,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:11,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:12:11,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441812169] [2023-10-12 17:12:11,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:11,669 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:12:11,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:11,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:12:11,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:12:11,670 INFO L87 Difference]: Start difference. First operand 100 states and 259 transitions. cyclomatic complexity: 184 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:11,688 INFO L93 Difference]: Finished difference Result 111 states and 270 transitions. [2023-10-12 17:12:11,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 270 transitions. [2023-10-12 17:12:11,689 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 47 [2023-10-12 17:12:11,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 99 states and 239 transitions. [2023-10-12 17:12:11,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2023-10-12 17:12:11,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2023-10-12 17:12:11,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 239 transitions. [2023-10-12 17:12:11,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,690 INFO L219 hiAutomatonCegarLoop]: Abstraction has 99 states and 239 transitions. [2023-10-12 17:12:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 239 transitions. [2023-10-12 17:12:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2023-10-12 17:12:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 2.413793103448276) internal successors, (210), 86 states have internal predecessors, (210), 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:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 210 transitions. [2023-10-12 17:12:11,692 INFO L241 hiAutomatonCegarLoop]: Abstraction has 87 states and 210 transitions. [2023-10-12 17:12:11,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:12:11,692 INFO L430 stractBuchiCegarLoop]: Abstraction has 87 states and 210 transitions. [2023-10-12 17:12:11,692 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:12:11,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 210 transitions. [2023-10-12 17:12:11,693 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 43 [2023-10-12 17:12:11,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:11,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:11,693 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:11,693 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:12:11,694 INFO L748 eck$LassoCheckResult]: Stem: 3793#[$Ultimate##0]don't care [41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 3701#[L8]don't care [63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 3703#[L19, L8-1]don't care [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 3715#[L20, L8-1]don't care [66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 3717#[L27, L20, L9]don't care [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 3767#[L27, L9, L19]don't care [69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 3723#[L35, L27, L10, L19]don't care [58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 3637#[L35, L10, L19, L28]don't care [60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 3639#[L35, L27, L10, L19]don't care [2023-10-12 17:12:11,694 INFO L750 eck$LassoCheckResult]: Loop: 3639#[L35, L27, L10, L19]don't care [54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[] 3753#[L27, L10, L19, L36]don't care [56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x] 3787#[L35, L27, L10, L19]don't care [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 3653#[L35, L27, L10, L20]don't care [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 3743#[L35, L27, L10, L19]don't care [58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 3751#[L35, L10, L19, L28]don't care [60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 3639#[L35, L27, L10, L19]don't care [2023-10-12 17:12:11,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1794490470, now seen corresponding path program 1 times [2023-10-12 17:12:11,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166214387] [2023-10-12 17:12:11,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:11,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1808230905, now seen corresponding path program 1 times [2023-10-12 17:12:11,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67701017] [2023-10-12 17:12:11,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:11,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash -983328, now seen corresponding path program 1 times [2023-10-12 17:12:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130841520] [2023-10-12 17:12:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,771 INFO L201 PluginConnector]: Adding new model concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:12:11 BoogieIcfgContainer [2023-10-12 17:12:11,771 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:12:11,771 INFO L158 Benchmark]: Toolchain (without parser) took 2160.22ms. Allocated memory was 175.1MB in the beginning and 290.5MB in the end (delta: 115.3MB). Free memory was 129.4MB in the beginning and 192.8MB in the end (delta: -63.4MB). Peak memory consumption was 52.2MB. Max. memory is 8.0GB. [2023-10-12 17:12:11,772 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 175.1MB. Free memory was 130.4MB in the beginning and 130.2MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:11,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.30ms. Allocated memory is still 175.1MB. Free memory was 129.4MB in the beginning and 127.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:11,772 INFO L158 Benchmark]: Boogie Preprocessor took 12.97ms. Allocated memory is still 175.1MB. Free memory was 127.8MB in the beginning and 126.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:11,774 INFO L158 Benchmark]: RCFGBuilder took 157.11ms. Allocated memory is still 175.1MB. Free memory was 126.6MB in the beginning and 117.8MB in the end (delta: 8.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:12:11,774 INFO L158 Benchmark]: BuchiAutomizer took 1966.86ms. Allocated memory was 175.1MB in the beginning and 290.5MB in the end (delta: 115.3MB). Free memory was 117.8MB in the beginning and 192.8MB in the end (delta: -75.0MB). Peak memory consumption was 40.7MB. Max. memory is 8.0GB. [2023-10-12 17:12:11,775 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.24ms. Allocated memory is still 175.1MB. Free memory was 130.4MB in the beginning and 130.2MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.30ms. Allocated memory is still 175.1MB. Free memory was 129.4MB in the beginning and 127.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.97ms. Allocated memory is still 175.1MB. Free memory was 127.8MB in the beginning and 126.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 157.11ms. Allocated memory is still 175.1MB. Free memory was 126.6MB in the beginning and 117.8MB in the end (delta: 8.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1966.86ms. Allocated memory was 175.1MB in the beginning and 290.5MB in the end (delta: 115.3MB). Free memory was 117.8MB in the beginning and 192.8MB in the end (delta: -75.0MB). Peak memory consumption was 40.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 3 + -2 * x and consists of 4 locations. One deterministic module has affine ranking function 5 + -2 * x and consists of 5 locations. One deterministic module has affine ranking function 3 + -2 * x and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 87 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 454 StatesRemovedByMinimization, 6 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, 141 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 312 IncrementalHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 53 mSDtfsCounter, 312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI1 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq200 hnf87 smp100 dnf100 smp100 tf114 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 59ms 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: 35]: 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 one(); VAL [x=1] [L19] COND TRUE 1 x == 1 VAL [x=1] [L9] FORK 0 fork 2 two(); VAL [x=1] [L20] 1 x := 2; VAL [x=2] [L10] FORK 0 fork 3 three(); VAL [x=2] [L27] COND TRUE 2 x == 2 VAL [x=2] [L28] 2 x := 3; VAL [x=3] Loop: [L35] COND TRUE x == 3 [L36] x := 1; [L19] COND TRUE x == 1 [L20] x := 2; [L27] COND TRUE x == 2 [L28] x := 3; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: 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 one(); VAL [x=1] [L19] COND TRUE 1 x == 1 VAL [x=1] [L9] FORK 0 fork 2 two(); VAL [x=1] [L20] 1 x := 2; VAL [x=2] [L10] FORK 0 fork 3 three(); VAL [x=2] [L27] COND TRUE 2 x == 2 VAL [x=2] [L28] 2 x := 3; VAL [x=3] Loop: [L35] COND TRUE x == 3 [L36] x := 1; [L19] COND TRUE x == 1 [L20] x := 2; [L27] COND TRUE x == 2 [L28] x := 3; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 27 PlacesBefore, 24 PlacesAfterwards, 26 TransitionsBefore, 23 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 432 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 365, independent: 341, independent conditional: 0, independent unconditional: 341, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 160, independent: 151, independent conditional: 0, independent unconditional: 151, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 160, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 365, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 160, unknown conditional: 0, unknown unconditional: 160] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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:11,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:12:11,999 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...