/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_FiveToOne_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:12:09,655 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:12:09,732 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,761 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:12:09,762 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:12:09,762 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:12:09,763 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:12:09,764 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:12:09,764 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:12:09,765 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:12:09,765 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:12:09,766 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:12:09,766 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:12:09,766 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:12:09,766 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:12:09,766 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:12:09,767 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:12:09,767 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:12:09,767 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:12:09,767 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:12:09,767 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:12:09,785 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:12:09,785 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:12:09,786 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:12:09,786 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:12:09,786 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:12:09,787 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:12:09,787 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:12:09,787 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:12:09,787 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:12:09,787 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:12:09,788 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:12:09,788 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:12:09,788 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:12:09,789 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,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:12:09,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:12:09,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:12:09,963 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:12:09,964 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:12:09,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_FiveToOne_nonterminating.bpl [2023-10-12 17:12:09,965 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_FiveToOne_nonterminating.bpl' [2023-10-12 17:12:09,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:12:09,978 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:12:09,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:09,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:12:09,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:12:09,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,998 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:12:09,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:10,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:12:10,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:12:10,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:12:10,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:10,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:10,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:10,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:10,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:10,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:10,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:10,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:10,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:12:10,014 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:12:10,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:12:10,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:12:10,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:10,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,063 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:10,073 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:10,091 INFO L124 BoogieDeclarations]: Specification and implementation of procedure once given in one single declaration [2023-10-12 17:12:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure once [2023-10-12 17:12:10,091 INFO L138 BoogieDeclarations]: Found implementation of procedure once [2023-10-12 17:12:10,091 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:12:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:12:10,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:12:10,092 INFO L124 BoogieDeclarations]: Specification and implementation of procedure five given in one single declaration [2023-10-12 17:12:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure five [2023-10-12 17:12:10,092 INFO L138 BoogieDeclarations]: Found implementation of procedure five [2023-10-12 17:12:10,092 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:10,123 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:12:10,124 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:12:10,176 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:12:10,180 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:12:10,180 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:12:10,181 INFO L201 PluginConnector]: Adding new model concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:10 BoogieIcfgContainer [2023-10-12 17:12:10,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:12:10,182 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:12:10,182 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:12:10,186 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:12:10,187 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:10,187 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/2) ... [2023-10-12 17:12:10,188 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b4c247c and model type concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:12:10, skipping insertion in model container [2023-10-12 17:12:10,188 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:10,188 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:10" (2/2) ... [2023-10-12 17:12:10,189 INFO L332 chiAutomizerObserver]: Analyzing ICFG concurrent_FiveToOne_nonterminating.bpl [2023-10-12 17:12:10,258 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:12:10,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 20 transitions, 62 flow [2023-10-12 17:12:10,301 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-10-12 17:12:10,301 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:12:10,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 3/16 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2023-10-12 17:12:10,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 20 transitions, 62 flow [2023-10-12 17:12:10,308 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 16 transitions, 50 flow [2023-10-12 17:12:10,315 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:12:10,336 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 16 transitions, 50 flow [2023-10-12 17:12:10,338 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 16 transitions, 50 flow [2023-10-12 17:12:10,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 50 flow [2023-10-12 17:12:10,341 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-10-12 17:12:10,341 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:12:10,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 3/16 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2023-10-12 17:12:10,342 INFO L119 LiptonReduction]: Number of co-enabled transitions 56 [2023-10-12 17:12:10,410 INFO L134 LiptonReduction]: Checked pairs total: 90 [2023-10-12 17:12:10,410 INFO L136 LiptonReduction]: Total number of compositions: 4 [2023-10-12 17:12:10,423 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:12:10,423 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:12:10,423 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:12:10,423 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:12:10,423 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:12:10,423 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:12:10,424 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:12:10,424 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:12:10,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:12:10,442 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2023-10-12 17:12:10,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:10,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:10,445 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:12:10,446 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:10,446 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:12:10,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 13 states, but on-demand construction may add more states [2023-10-12 17:12:10,447 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2023-10-12 17:12:10,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:10,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:10,447 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:12:10,447 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:10,451 INFO L748 eck$LassoCheckResult]: Stem: 24#[$Ultimate##0]don't care [31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 27#[L8]don't care [44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0] 29#[L17, L8-1]don't care [2023-10-12 17:12:10,451 INFO L750 eck$LassoCheckResult]: Loop: 29#[L17, L8-1]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 29#[L17, L8-1]don't care [2023-10-12 17:12:10,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1966, now seen corresponding path program 1 times [2023-10-12 17:12:10,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817212592] [2023-10-12 17:12:10,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 1 times [2023-10-12 17:12:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735241502] [2023-10-12 17:12:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,594 INFO L85 PathProgramCache]: Analyzing trace with hash 61000, now seen corresponding path program 1 times [2023-10-12 17:12:10,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660449360] [2023-10-12 17:12:10,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,647 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:10,648 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:10,648 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:10,648 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:10,648 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:10,648 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,648 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:10,649 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:10,649 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:12:10,649 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:10,649 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:10,659 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,687 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:10,688 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:10,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,691 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,692 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,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:10,694 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:10,719 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,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,720 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,722 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,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:10,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:10,756 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:10,777 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,777 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:10,777 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:10,778 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:10,778 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:10,778 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:10,778 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,778 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:10,778 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:10,778 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:12:10,778 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:10,778 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:10,779 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,810 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:10,813 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:10,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,818 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,819 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,820 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,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:10,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:10,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:10,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:10,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:10,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:10,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:10,855 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:10,860 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:10,860 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:12:10,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,864 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,865 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,910 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:10,910 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:10,910 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:10,911 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 7 Supporting invariants [] [2023-10-12 17:12:10,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:12:10,916 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:10,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:10,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:10,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,019 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,020 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,060 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:12:11,061 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 13 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,094 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 13 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 92 transitions. Complement of second has 5 states. [2023-10-12 17:12:11,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:11,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2023-10-12 17:12:11,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:12:11,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:12:11,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:12:11,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 92 transitions. [2023-10-12 17:12:11,107 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2023-10-12 17:12:11,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 17 states and 36 transitions. [2023-10-12 17:12:11,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-10-12 17:12:11,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-10-12 17:12:11,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 36 transitions. [2023-10-12 17:12:11,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,111 INFO L219 hiAutomatonCegarLoop]: Abstraction has 17 states and 36 transitions. [2023-10-12 17:12:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 36 transitions. [2023-10-12 17:12:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2023-10-12 17:12:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2023-10-12 17:12:11,127 INFO L241 hiAutomatonCegarLoop]: Abstraction has 13 states and 27 transitions. [2023-10-12 17:12:11,127 INFO L430 stractBuchiCegarLoop]: Abstraction has 13 states and 27 transitions. [2023-10-12 17:12:11,127 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:12:11,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 27 transitions. [2023-10-12 17:12:11,128 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2023-10-12 17:12:11,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:11,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:11,128 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:12:11,128 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:11,128 INFO L748 eck$LassoCheckResult]: Stem: 140#[$Ultimate##0]don't care [31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 142#[L8]don't care [44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0] 148#[L17, L8-1]don't care [53] L17-->fiveEXIT: Formula: (<= 4 v_x_22) InVars {x=v_x_22} OutVars{x=v_x_22} AuxVars[] AssignedVars[] 144#[fiveEXIT, L8-1]don't care [47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0] 132#[L25, L9, fiveEXIT]don't care [2023-10-12 17:12:11,129 INFO L750 eck$LassoCheckResult]: Loop: 132#[L25, L9, fiveEXIT]don't care [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 132#[L25, L9, fiveEXIT]don't care [2023-10-12 17:12:11,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1891016, now seen corresponding path program 1 times [2023-10-12 17:12:11,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919725906] [2023-10-12 17:12:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,154 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,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:11,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919725906] [2023-10-12 17:12:11,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919725906] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:11,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:11,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:12:11,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206153374] [2023-10-12 17:12:11,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:11,158 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:11,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,158 INFO L85 PathProgramCache]: Analyzing trace with hash 86, now seen corresponding path program 1 times [2023-10-12 17:12:11,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133339368] [2023-10-12 17:12:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:11,173 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:11,173 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:11,173 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:11,173 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:11,173 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:11,173 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,174 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:11,174 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:11,174 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:12:11,174 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:11,174 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:11,174 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,189 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:11,189 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:11,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,190 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:11,192 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:11,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:11,194 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:11,209 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:11,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,211 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:11,213 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:11,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:11,215 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:11,231 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:11,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-10-12 17:12:11,234 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:11,234 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:11,234 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:11,234 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:11,234 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:11,234 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,234 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:11,234 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:11,234 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:12:11,235 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:11,235 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:11,235 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,251 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:11,251 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:11,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,260 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:11,277 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:11,278 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,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:11,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:11,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:11,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:11,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:11,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:11,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:11,298 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:11,315 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:12:11,315 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:12:11,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,324 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:11,325 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:11,326 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:11,326 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:11,326 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:11,326 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2023-10-12 17:12:11,330 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:11,331 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:11,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,352 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,352 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,353 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:12:11,353 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 27 transitions. cyclomatic complexity: 21 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,367 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 27 transitions. cyclomatic complexity: 21. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 53 transitions. Complement of second has 5 states. [2023-10-12 17:12:11,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2023-10-12 17:12:11,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:12:11,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:12:11,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:12:11,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 53 transitions. [2023-10-12 17:12:11,371 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2023-10-12 17:12:11,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 16 states and 33 transitions. [2023-10-12 17:12:11,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-10-12 17:12:11,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-10-12 17:12:11,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 33 transitions. [2023-10-12 17:12:11,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,372 INFO L219 hiAutomatonCegarLoop]: Abstraction has 16 states and 33 transitions. [2023-10-12 17:12:11,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 33 transitions. [2023-10-12 17:12:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2023-10-12 17:12:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 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,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2023-10-12 17:12:11,374 INFO L241 hiAutomatonCegarLoop]: Abstraction has 13 states and 26 transitions. [2023-10-12 17:12:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:11,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:12:11,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:12:11,376 INFO L87 Difference]: Start difference. First operand 13 states and 26 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:11,390 INFO L93 Difference]: Finished difference Result 20 states and 32 transitions. [2023-10-12 17:12:11,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 32 transitions. [2023-10-12 17:12:11,391 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4 [2023-10-12 17:12:11,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 25 transitions. [2023-10-12 17:12:11,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-10-12 17:12:11,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-10-12 17:12:11,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 25 transitions. [2023-10-12 17:12:11,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,392 INFO L219 hiAutomatonCegarLoop]: Abstraction has 15 states and 25 transitions. [2023-10-12 17:12:11,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 25 transitions. [2023-10-12 17:12:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2023-10-12 17:12:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2023-10-12 17:12:11,393 INFO L241 hiAutomatonCegarLoop]: Abstraction has 11 states and 19 transitions. [2023-10-12 17:12:11,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:12:11,394 INFO L430 stractBuchiCegarLoop]: Abstraction has 11 states and 19 transitions. [2023-10-12 17:12:11,394 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:12:11,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 19 transitions. [2023-10-12 17:12:11,394 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4 [2023-10-12 17:12:11,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:11,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:11,395 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:12:11,395 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:12:11,395 INFO L748 eck$LassoCheckResult]: Stem: 268#[$Ultimate##0]don't care [31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 270#[L8]don't care [44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0] 274#[L17, L8-1]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 276#[L17, L8-1]don't care [47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0] 260#[L25, L9, L17]don't care [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 262#[L25, L9, L17]don't care [2023-10-12 17:12:11,395 INFO L750 eck$LassoCheckResult]: Loop: 262#[L25, L9, L17]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 278#[L25, L9, L17]don't care [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 262#[L25, L9, L17]don't care [2023-10-12 17:12:11,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash 58622512, now seen corresponding path program 1 times [2023-10-12 17:12:11,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233243772] [2023-10-12 17:12:11,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,416 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,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:11,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233243772] [2023-10-12 17:12:11,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233243772] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:11,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:11,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:12:11,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886788092] [2023-10-12 17:12:11,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:11,418 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:11,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2690, now seen corresponding path program 1 times [2023-10-12 17:12:11,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123174908] [2023-10-12 17:12:11,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:11,459 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:11,459 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:11,459 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:11,459 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:11,459 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:11,459 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,460 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:11,460 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:11,460 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:12:11,460 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:11,460 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:11,460 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,476 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:11,476 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:11,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,477 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,498 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,499 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:11,499 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:11,518 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,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,520 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,522 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,523 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:11,524 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:11,553 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:11,557 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,558 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:11,558 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:11,558 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:11,558 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:11,558 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:11,558 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,558 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:11,558 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:11,558 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:12:11,558 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:11,558 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:11,559 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,575 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:11,575 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:11,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,590 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,597 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,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:11,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:11,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:11,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:11,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:11,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:11,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:11,607 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,616 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:11,618 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:11,618 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:12:11,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,641 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,642 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,644 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:11,644 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:11,644 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:11,644 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2023-10-12 17:12:11,655 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,656 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:11,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,682 WARN L260 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,695 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,696 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,696 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 19 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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,715 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 19 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 23 states and 41 transitions. Complement of second has 7 states. [2023-10-12 17:12:11,716 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,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2023-10-12 17:12:11,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:12:11,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:12:11,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:12:11,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 41 transitions. [2023-10-12 17:12:11,730 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4 [2023-10-12 17:12:11,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 34 transitions. [2023-10-12 17:12:11,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-10-12 17:12:11,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-10-12 17:12:11,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 34 transitions. [2023-10-12 17:12:11,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,731 INFO L219 hiAutomatonCegarLoop]: Abstraction has 19 states and 34 transitions. [2023-10-12 17:12:11,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 34 transitions. [2023-10-12 17:12:11,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2023-10-12 17:12:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 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,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2023-10-12 17:12:11,732 INFO L241 hiAutomatonCegarLoop]: Abstraction has 14 states and 26 transitions. [2023-10-12 17:12:11,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:11,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:12:11,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:12:11,733 INFO L87 Difference]: Start difference. First operand 14 states and 26 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:11,748 INFO L93 Difference]: Finished difference Result 24 states and 38 transitions. [2023-10-12 17:12:11,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 38 transitions. [2023-10-12 17:12:11,761 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2023-10-12 17:12:11,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 36 transitions. [2023-10-12 17:12:11,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2023-10-12 17:12:11,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2023-10-12 17:12:11,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 36 transitions. [2023-10-12 17:12:11,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,762 INFO L219 hiAutomatonCegarLoop]: Abstraction has 22 states and 36 transitions. [2023-10-12 17:12:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 36 transitions. [2023-10-12 17:12:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2023-10-12 17:12:11,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 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,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 24 transitions. [2023-10-12 17:12:11,764 INFO L241 hiAutomatonCegarLoop]: Abstraction has 14 states and 24 transitions. [2023-10-12 17:12:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:12:11,764 INFO L430 stractBuchiCegarLoop]: Abstraction has 14 states and 24 transitions. [2023-10-12 17:12:11,764 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:12:11,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 24 transitions. [2023-10-12 17:12:11,765 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2023-10-12 17:12:11,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:11,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:11,765 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2023-10-12 17:12:11,765 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1] [2023-10-12 17:12:11,766 INFO L748 eck$LassoCheckResult]: Stem: 409#[$Ultimate##0]don't care [31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 411#[L8]don't care [44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0] 415#[L17, L8-1]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 417#[L17, L8-1]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 419#[L17, L8-1]don't care [47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0] 401#[L25, L9, L17]don't care [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 403#[L25, L9, L17]don't care [2023-10-12 17:12:11,766 INFO L750 eck$LassoCheckResult]: Loop: 403#[L25, L9, L17]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 421#[L25, L9, L17]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 425#[L25, L9, L17]don't care [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 403#[L25, L9, L17]don't care [2023-10-12 17:12:11,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1817304406, now seen corresponding path program 2 times [2023-10-12 17:12:11,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443618161] [2023-10-12 17:12:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,825 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,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:11,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:11,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:11,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443618161] [2023-10-12 17:12:11,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443618161] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:12:11,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884170186] [2023-10-12 17:12:11,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:12:11,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:12:11,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,893 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:12:11,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-10-12 17:12:11,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:12:11,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:12:11,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:11,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:12:12,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:12,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884170186] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:12:12,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:12:12,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-10-12 17:12:12,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387776314] [2023-10-12 17:12:12,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:12:12,002 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:12,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,002 INFO L85 PathProgramCache]: Analyzing trace with hash 83414, now seen corresponding path program 2 times [2023-10-12 17:12:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053287082] [2023-10-12 17:12:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,031 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:12,031 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:12,031 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:12,031 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:12,033 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:12,033 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,037 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:12,037 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:12,037 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration4_Loop [2023-10-12 17:12:12,037 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:12,037 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:12,038 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:12,053 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:12,053 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:12,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,057 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:12,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:12:12,062 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:12,062 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:12,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:12,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,087 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:12,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:12:12,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:12,114 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:12,136 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:12,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:12,151 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:12,151 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:12,151 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:12,151 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:12,151 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:12,151 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,151 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:12,151 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:12,151 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration4_Loop [2023-10-12 17:12:12,151 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:12,151 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:12,152 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:12,169 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:12,169 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:12,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,170 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:12,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:12:12,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:12:12,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:12,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:12,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:12,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:12,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:12,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:12,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:12,204 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:12,206 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:12:12,206 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:12:12,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,225 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:12,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:12:12,242 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:12,242 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:12,242 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:12,242 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2023-10-12 17:12:12,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:12,245 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:12,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:12,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:12,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:12,289 WARN L260 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:12:12,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:12,312 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-10-12 17:12:12,313 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 24 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:12,362 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 24 transitions. cyclomatic complexity: 15. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 56 transitions. Complement of second has 9 states. [2023-10-12 17:12:12,362 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:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2023-10-12 17:12:12,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 6 letters. Loop has 3 letters. [2023-10-12 17:12:12,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:12,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 9 letters. Loop has 3 letters. [2023-10-12 17:12:12,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:12,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 6 letters. Loop has 6 letters. [2023-10-12 17:12:12,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:12,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 56 transitions. [2023-10-12 17:12:12,366 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2023-10-12 17:12:12,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 45 transitions. [2023-10-12 17:12:12,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-10-12 17:12:12,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-10-12 17:12:12,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 45 transitions. [2023-10-12 17:12:12,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:12,367 INFO L219 hiAutomatonCegarLoop]: Abstraction has 26 states and 45 transitions. [2023-10-12 17:12:12,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 45 transitions. [2023-10-12 17:12:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2023-10-12 17:12:12,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 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:12,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2023-10-12 17:12:12,388 INFO L241 hiAutomatonCegarLoop]: Abstraction has 18 states and 32 transitions. [2023-10-12 17:12:12,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:12,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:12:12,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:12:12,389 INFO L87 Difference]: Start difference. First operand 18 states and 32 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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:12,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:12,407 INFO L93 Difference]: Finished difference Result 31 states and 49 transitions. [2023-10-12 17:12:12,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 49 transitions. [2023-10-12 17:12:12,410 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-10-12 17:12:12,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 46 transitions. [2023-10-12 17:12:12,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-10-12 17:12:12,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-10-12 17:12:12,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 46 transitions. [2023-10-12 17:12:12,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:12,412 INFO L219 hiAutomatonCegarLoop]: Abstraction has 28 states and 46 transitions. [2023-10-12 17:12:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 46 transitions. [2023-10-12 17:12:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2023-10-12 17:12:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 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:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2023-10-12 17:12:12,416 INFO L241 hiAutomatonCegarLoop]: Abstraction has 17 states and 29 transitions. [2023-10-12 17:12:12,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:12:12,418 INFO L430 stractBuchiCegarLoop]: Abstraction has 17 states and 29 transitions. [2023-10-12 17:12:12,418 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:12:12,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 29 transitions. [2023-10-12 17:12:12,419 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-10-12 17:12:12,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:12,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:12,433 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2023-10-12 17:12:12,433 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 1] [2023-10-12 17:12:12,433 INFO L748 eck$LassoCheckResult]: Stem: 621#[$Ultimate##0]don't care [31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 623#[L8]don't care [44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0] 627#[L17, L8-1]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 629#[L17, L8-1]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 633#[L17, L8-1]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 637#[L17, L8-1]don't care [47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0] 613#[L25, L9, L17]don't care [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 615#[L25, L9, L17]don't care [2023-10-12 17:12:12,434 INFO L750 eck$LassoCheckResult]: Loop: 615#[L25, L9, L17]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 635#[L25, L9, L17]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 643#[L25, L9, L17]don't care [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 641#[L25, L9, L17]don't care [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 615#[L25, L9, L17]don't care [2023-10-12 17:12:12,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,434 INFO L85 PathProgramCache]: Analyzing trace with hash 501868272, now seen corresponding path program 3 times [2023-10-12 17:12:12,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045221426] [2023-10-12 17:12:12,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2585858, now seen corresponding path program 3 times [2023-10-12 17:12:12,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220538448] [2023-10-12 17:12:12,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1210692495, now seen corresponding path program 4 times [2023-10-12 17:12:12,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355031227] [2023-10-12 17:12:12,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,669 INFO L201 PluginConnector]: Adding new model concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:12:12 BoogieIcfgContainer [2023-10-12 17:12:12,670 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:12:12,672 INFO L158 Benchmark]: Toolchain (without parser) took 2691.91ms. Allocated memory was 181.4MB in the beginning and 251.7MB in the end (delta: 70.3MB). Free memory was 134.0MB in the beginning and 182.6MB in the end (delta: -48.6MB). Peak memory consumption was 21.2MB. Max. memory is 8.0GB. [2023-10-12 17:12:12,673 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.30ms. Allocated memory is still 181.4MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:12,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.35ms. Allocated memory is still 181.4MB. Free memory was 133.8MB in the beginning and 132.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:12:12,673 INFO L158 Benchmark]: Boogie Preprocessor took 13.35ms. Allocated memory is still 181.4MB. Free memory was 132.2MB in the beginning and 131.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:12,673 INFO L158 Benchmark]: RCFGBuilder took 167.07ms. Allocated memory is still 181.4MB. Free memory was 131.2MB in the beginning and 122.6MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-10-12 17:12:12,674 INFO L158 Benchmark]: BuchiAutomizer took 2487.71ms. Allocated memory was 181.4MB in the beginning and 251.7MB in the end (delta: 70.3MB). Free memory was 122.5MB in the beginning and 182.6MB in the end (delta: -60.1MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2023-10-12 17:12:12,675 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.30ms. Allocated memory is still 181.4MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.35ms. Allocated memory is still 181.4MB. Free memory was 133.8MB in the beginning and 132.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.35ms. Allocated memory is still 181.4MB. Free memory was 132.2MB in the beginning and 131.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 167.07ms. Allocated memory is still 181.4MB. Free memory was 131.2MB in the beginning and 122.6MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2487.71ms. Allocated memory was 181.4MB in the beginning and 251.7MB in the end (delta: 70.3MB). Free memory was 122.5MB in the beginning and 182.6MB in the end (delta: -60.1MB). Peak memory consumption was 9.6MB. 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 7 terminating modules (3 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 7 + -2 * x and consists of 3 locations. One deterministic module has affine ranking function x and consists of 3 locations. One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function x and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 5 iterations. TraceHistogramMax:3. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 43 StatesRemovedByMinimization, 7 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 115 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 8 mSDtfsCounter, 115 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf89 smp100 dnf100 smp100 tf114 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 96ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 five(); VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=4] [L9] FORK 0 fork 2 once(); VAL [x=4] [L25] COND TRUE 2 x == 4 [L26] 2 x := 1; VAL [x=1] Loop: [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L25] COND TRUE x == 4 [L26] x := 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 five(); VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=4] [L9] FORK 0 fork 2 once(); VAL [x=4] [L25] COND TRUE 2 x == 4 [L26] 2 x := 1; VAL [x=1] Loop: [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L25] COND TRUE x == 4 [L26] x := 1; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 19 PlacesBefore, 15 PlacesAfterwards, 16 TransitionsBefore, 12 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 90 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 42, unknown conditional: 0, unknown unconditional: 42] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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:12,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:12,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:13,121 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...