/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/Nconcurrent_FourLoopsAlternating_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:12:09,088 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:12:09,308 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,330 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:12:09,330 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:12:09,331 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:12:09,332 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:12:09,332 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:12:09,332 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:12:09,333 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:12:09,333 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:12:09,333 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:12:09,334 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:12:09,334 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:12:09,334 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:12:09,335 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:12:09,335 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:12:09,335 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:12:09,336 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:12:09,336 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:12:09,336 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:12:09,340 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:12:09,340 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:12:09,340 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:12:09,341 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:12:09,341 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:12:09,341 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:12:09,341 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:12:09,342 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:12:09,342 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:12:09,342 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:12:09,343 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:12:09,343 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:12:09,344 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:12:09,344 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,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:12:09,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:12:09,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:12:09,604 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:12:09,604 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:12:09,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/Nconcurrent_FourLoopsAlternating_nonterminating.bpl [2023-10-12 17:12:09,606 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/Nconcurrent_FourLoopsAlternating_nonterminating.bpl' [2023-10-12 17:12:09,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:12:09,626 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:12:09,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:09,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:12:09,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:12:09,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,652 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:12:09,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:09,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:12:09,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:12:09,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:12:09,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:12:09,674 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:12:09,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:12:09,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:12:09,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/1) ... [2023-10-12 17:12:09,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:09,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:09,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:09,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:12:09,743 INFO L124 BoogieDeclarations]: Specification and implementation of procedure four given in one single declaration [2023-10-12 17:12:09,743 INFO L130 BoogieDeclarations]: Found specification of procedure four [2023-10-12 17:12:09,743 INFO L138 BoogieDeclarations]: Found implementation of procedure four [2023-10-12 17:12:09,743 INFO L124 BoogieDeclarations]: Specification and implementation of procedure one given in one single declaration [2023-10-12 17:12:09,743 INFO L130 BoogieDeclarations]: Found specification of procedure one [2023-10-12 17:12:09,743 INFO L138 BoogieDeclarations]: Found implementation of procedure one [2023-10-12 17:12:09,744 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:12:09,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:12:09,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:12:09,744 INFO L124 BoogieDeclarations]: Specification and implementation of procedure three given in one single declaration [2023-10-12 17:12:09,744 INFO L130 BoogieDeclarations]: Found specification of procedure three [2023-10-12 17:12:09,745 INFO L138 BoogieDeclarations]: Found implementation of procedure three [2023-10-12 17:12:09,745 INFO L124 BoogieDeclarations]: Specification and implementation of procedure two given in one single declaration [2023-10-12 17:12:09,745 INFO L130 BoogieDeclarations]: Found specification of procedure two [2023-10-12 17:12:09,745 INFO L138 BoogieDeclarations]: Found implementation of procedure two [2023-10-12 17:12:09,746 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:12:09,784 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:12:09,786 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:12:09,857 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:12:09,861 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:12:09,861 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:12:09,862 INFO L201 PluginConnector]: Adding new model Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:09 BoogieIcfgContainer [2023-10-12 17:12:09,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:12:09,863 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:12:09,863 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:12:09,869 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:12:09,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:09,869 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:09" (1/2) ... [2023-10-12 17:12:09,880 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a11e30d and model type Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:12:09, skipping insertion in model container [2023-10-12 17:12:09,880 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:09,880 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:09" (2/2) ... [2023-10-12 17:12:09,881 INFO L332 chiAutomizerObserver]: Analyzing ICFG Nconcurrent_FourLoopsAlternating_nonterminating.bpl [2023-10-12 17:12:09,939 INFO L144 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2023-10-12 17:12:09,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 46 transitions, 160 flow [2023-10-12 17:12:10,003 INFO L124 PetriNetUnfolderBase]: 21/54 cut-off events. [2023-10-12 17:12:10,004 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-10-12 17:12:10,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 54 events. 21/54 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 117 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 49. Up to 12 conditions per place. [2023-10-12 17:12:10,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 46 transitions, 160 flow [2023-10-12 17:12:10,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 38 transitions, 136 flow [2023-10-12 17:12:10,018 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:12:10,051 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 38 transitions, 136 flow [2023-10-12 17:12:10,057 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 38 transitions, 136 flow [2023-10-12 17:12:10,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 38 transitions, 136 flow [2023-10-12 17:12:10,068 INFO L124 PetriNetUnfolderBase]: 21/54 cut-off events. [2023-10-12 17:12:10,068 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-10-12 17:12:10,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 54 events. 21/54 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 117 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 49. Up to 12 conditions per place. [2023-10-12 17:12:10,071 INFO L119 LiptonReduction]: Number of co-enabled transitions 528 [2023-10-12 17:12:10,190 INFO L134 LiptonReduction]: Checked pairs total: 936 [2023-10-12 17:12:10,190 INFO L136 LiptonReduction]: Total number of compositions: 4 [2023-10-12 17:12:10,205 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:12:10,205 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:12:10,206 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:12:10,206 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:12:10,206 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:12:10,206 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:12:10,206 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:12:10,206 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:12:10,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:12:10,327 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 276 [2023-10-12 17:12:10,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:10,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:10,332 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:12:10,332 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:12:10,333 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:12:10,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 297 states, but on-demand construction may add more states [2023-10-12 17:12:10,347 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 276 [2023-10-12 17:12:10,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:10,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:10,348 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:12:10,348 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:12:10,352 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]don't care [60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x] 45#[L8]don't care [91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0] 47#[L8-1, L21]don't care [2023-10-12 17:12:10,352 INFO L750 eck$LassoCheckResult]: Loop: 47#[L8-1, L21]don't care [69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[] 51#[L8-1, L22]don't care [71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 47#[L8-1, L21]don't care [2023-10-12 17:12:10,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2912, now seen corresponding path program 1 times [2023-10-12 17:12:10,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443968659] [2023-10-12 17:12:10,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,483 INFO L85 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 1 times [2023-10-12 17:12:10,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503156583] [2023-10-12 17:12:10,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2800642, now seen corresponding path program 1 times [2023-10-12 17:12:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861778984] [2023-10-12 17:12:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,536 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:10,537 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:10,537 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:10,537 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:10,537 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:10,537 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,537 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:10,537 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:10,538 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_FourLoopsAlternating_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:12:10,538 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:10,538 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:10,550 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,581 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:10,582 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:10,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,600 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,605 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:10,605 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:10,617 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,639 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,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,642 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,643 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,645 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:10,645 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:10,661 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:10,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:12:10,664 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:10,664 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:10,664 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:10,664 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:10,664 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:10,664 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,664 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:10,664 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:10,664 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_FourLoopsAlternating_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:12:10,664 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:10,664 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:10,665 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,689 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:10,693 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:10,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,695 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,701 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,702 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,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:10,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:10,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:10,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:10,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:10,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:10,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:10,720 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:10,724 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:10,724 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:12:10,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,749 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,751 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,787 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:10,787 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:10,787 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:10,788 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 3 Supporting invariants [] [2023-10-12 17:12:10,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:10,794 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:10,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:10,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:10,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:10,841 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:10,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:10,909 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:12:10,911 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 297 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,094 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 297 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1580 states and 6357 transitions. Complement of second has 7 states. [2023-10-12 17:12:11,096 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,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2023-10-12 17:12:11,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:12:11,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 4 letters. Loop has 2 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 4 states and 72 transitions. Stem has 2 letters. Loop has 4 letters. [2023-10-12 17:12:11,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1580 states and 6357 transitions. [2023-10-12 17:12:11,138 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 274 [2023-10-12 17:12:11,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1580 states to 1128 states and 4674 transitions. [2023-10-12 17:12:11,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 542 [2023-10-12 17:12:11,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 922 [2023-10-12 17:12:11,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1128 states and 4674 transitions. [2023-10-12 17:12:11,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,168 INFO L219 hiAutomatonCegarLoop]: Abstraction has 1128 states and 4674 transitions. [2023-10-12 17:12:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states and 4674 transitions. [2023-10-12 17:12:11,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 554. [2023-10-12 17:12:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 554 states have (on average 4.229241877256317) internal successors, (2343), 553 states have internal predecessors, (2343), 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,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 2343 transitions. [2023-10-12 17:12:11,252 INFO L241 hiAutomatonCegarLoop]: Abstraction has 554 states and 2343 transitions. [2023-10-12 17:12:11,252 INFO L430 stractBuchiCegarLoop]: Abstraction has 554 states and 2343 transitions. [2023-10-12 17:12:11,252 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:12:11,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 554 states and 2343 transitions. [2023-10-12 17:12:11,259 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 274 [2023-10-12 17:12:11,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:11,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:11,260 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:12:11,260 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:12:11,260 INFO L748 eck$LassoCheckResult]: Stem: 3277#[$Ultimate##0]don't care [60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x] 3219#[L8]don't care [91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0] 3221#[L8-1, L21]don't care [82] L8-1-->L29: Formula: (= v_twoThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork0_thidvar0=v_twoThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork0_thidvar0] 3285#[L21, L9, L29]don't care [109] L21-->oneEXIT: Formula: (not (= v_x_34 1)) InVars {x=v_x_34} OutVars{x=v_x_34} AuxVars[] AssignedVars[] 3289#[oneEXIT, L9, L29]don't care [2023-10-12 17:12:11,260 INFO L750 eck$LassoCheckResult]: Loop: 3289#[oneEXIT, L9, L29]don't care [77] L29-->L30: Formula: (= v_x_11 2) InVars {x=v_x_11} OutVars{x=v_x_11} AuxVars[] AssignedVars[] 3313#[L9, L30, oneEXIT]don't care [79] L30-->L29: Formula: (= v_x_12 3) InVars {} OutVars{x=v_x_12} AuxVars[] AssignedVars[x] 3289#[oneEXIT, L9, L29]don't care [2023-10-12 17:12:11,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2801083, now seen corresponding path program 1 times [2023-10-12 17:12:11,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548117564] [2023-10-12 17:12:11,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,310 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,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:11,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548117564] [2023-10-12 17:12:11,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548117564] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:11,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:11,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:12:11,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014699206] [2023-10-12 17:12:11,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:11,313 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:11,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,315 INFO L85 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2023-10-12 17:12:11,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472382399] [2023-10-12 17:12:11,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:11,342 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:11,342 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:11,342 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:11,342 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:11,342 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:11,342 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,342 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:11,342 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:11,343 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_FourLoopsAlternating_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:12:11,343 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:11,343 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:11,346 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,364 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:11,365 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:11,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,366 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,369 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,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:11,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:11,390 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,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,391 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,393 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,395 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:11,395 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:11,418 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:11,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:11,425 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:11,425 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:11,425 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:11,425 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:11,425 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:11,426 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,426 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:11,426 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:11,426 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_FourLoopsAlternating_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:12:11,426 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:11,426 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:11,427 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,449 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:11,449 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:11,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,450 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,460 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,461 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,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:11,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:11,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:11,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:11,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:11,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:11,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:11,475 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:11,479 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:11,479 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:12:11,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,482 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,483 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,484 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:11,484 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:11,484 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:11,484 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 5 Supporting invariants [] [2023-10-12 17:12:11,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:11,490 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:11,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,534 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,550 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,551 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,551 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 554 states and 2343 transitions. cyclomatic complexity: 1917 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,725 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 554 states and 2343 transitions. cyclomatic complexity: 1917. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1265 states and 5008 transitions. Complement of second has 9 states. [2023-10-12 17:12:11,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2023-10-12 17:12:11,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:12:11,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:12:11,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:12:11,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1265 states and 5008 transitions. [2023-10-12 17:12:11,743 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 274 [2023-10-12 17:12:11,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1265 states to 1030 states and 4084 transitions. [2023-10-12 17:12:11,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 525 [2023-10-12 17:12:11,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 724 [2023-10-12 17:12:11,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1030 states and 4084 transitions. [2023-10-12 17:12:11,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,758 INFO L219 hiAutomatonCegarLoop]: Abstraction has 1030 states and 4084 transitions. [2023-10-12 17:12:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states and 4084 transitions. [2023-10-12 17:12:11,798 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,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:12:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 682. [2023-10-12 17:12:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 682 states have (on average 4.225806451612903) internal successors, (2882), 681 states have internal predecessors, (2882), 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,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 2882 transitions. [2023-10-12 17:12:11,810 INFO L241 hiAutomatonCegarLoop]: Abstraction has 682 states and 2882 transitions. [2023-10-12 17:12:11,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:11,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:12:11,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:12:11,814 INFO L87 Difference]: Start difference. First operand 682 states and 2882 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:11,880 INFO L93 Difference]: Finished difference Result 952 states and 3573 transitions. [2023-10-12 17:12:11,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 952 states and 3573 transitions. [2023-10-12 17:12:11,891 INFO L131 ngComponentsAnalysis]: Automaton has 67 accepting balls. 346 [2023-10-12 17:12:11,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 952 states to 863 states and 3270 transitions. [2023-10-12 17:12:11,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 532 [2023-10-12 17:12:11,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 532 [2023-10-12 17:12:11,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 863 states and 3270 transitions. [2023-10-12 17:12:11,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,909 INFO L219 hiAutomatonCegarLoop]: Abstraction has 863 states and 3270 transitions. [2023-10-12 17:12:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states and 3270 transitions. [2023-10-12 17:12:11,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 791. [2023-10-12 17:12:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 791 states have (on average 3.8824273072060684) internal successors, (3071), 790 states have internal predecessors, (3071), 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,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3071 transitions. [2023-10-12 17:12:11,932 INFO L241 hiAutomatonCegarLoop]: Abstraction has 791 states and 3071 transitions. [2023-10-12 17:12:11,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:12:11,937 INFO L430 stractBuchiCegarLoop]: Abstraction has 791 states and 3071 transitions. [2023-10-12 17:12:11,937 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:12:11,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 791 states and 3071 transitions. [2023-10-12 17:12:11,945 INFO L131 ngComponentsAnalysis]: Automaton has 67 accepting balls. 331 [2023-10-12 17:12:11,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:11,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:11,946 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:11,946 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:12:11,948 INFO L748 eck$LassoCheckResult]: Stem: 8240#[$Ultimate##0]don't care [60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x] 8122#[L8]don't care [91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0] 8124#[L8-1, L21]don't care [82] L8-1-->L29: Formula: (= v_twoThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork0_thidvar0=v_twoThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork0_thidvar0] 8286#[L21, L9, L29]don't care [69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[] 8118#[L22, L9, L29]don't care [71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 8228#[L21, L9, L29]don't care [77] L29-->L30: Formula: (= v_x_11 2) InVars {x=v_x_11} OutVars{x=v_x_11} AuxVars[] AssignedVars[] 8276#[L21, L9, L30]don't care [109] L21-->oneEXIT: Formula: (not (= v_x_34 1)) InVars {x=v_x_34} OutVars{x=v_x_34} AuxVars[] AssignedVars[] 8330#[L9, L30, oneEXIT]don't care [2023-10-12 17:12:11,948 INFO L750 eck$LassoCheckResult]: Loop: 8330#[L9, L30, oneEXIT]don't care [79] L30-->L29: Formula: (= v_x_12 3) InVars {} OutVars{x=v_x_12} AuxVars[] AssignedVars[x] 8332#[oneEXIT, L9, L29]don't care [77] L29-->L30: Formula: (= v_x_11 2) InVars {x=v_x_11} OutVars{x=v_x_11} AuxVars[] AssignedVars[] 8330#[L9, L30, oneEXIT]don't care [2023-10-12 17:12:11,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1841564116, now seen corresponding path program 1 times [2023-10-12 17:12:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157277187] [2023-10-12 17:12:11,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:11,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,963 INFO L85 PathProgramCache]: Analyzing trace with hash 3487, now seen corresponding path program 2 times [2023-10-12 17:12:11,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234712729] [2023-10-12 17:12:11,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,994 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,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:11,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234712729] [2023-10-12 17:12:11,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234712729] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:11,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:11,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:12:11,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627564294] [2023-10-12 17:12:11,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:11,995 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:12:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:11,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:12:11,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:12:11,996 INFO L87 Difference]: Start difference. First operand 791 states and 3071 transitions. cyclomatic complexity: 2420 Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:12,054 INFO L93 Difference]: Finished difference Result 955 states and 3357 transitions. [2023-10-12 17:12:12,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 955 states and 3357 transitions. [2023-10-12 17:12:12,063 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 342 [2023-10-12 17:12:12,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 955 states to 786 states and 2712 transitions. [2023-10-12 17:12:12,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 586 [2023-10-12 17:12:12,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 648 [2023-10-12 17:12:12,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 786 states and 2712 transitions. [2023-10-12 17:12:12,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:12,072 INFO L219 hiAutomatonCegarLoop]: Abstraction has 786 states and 2712 transitions. [2023-10-12 17:12:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states and 2712 transitions. [2023-10-12 17:12:12,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 530. [2023-10-12 17:12:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 530 states have (on average 3.6150943396226416) internal successors, (1916), 529 states have internal predecessors, (1916), 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,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1916 transitions. [2023-10-12 17:12:12,087 INFO L241 hiAutomatonCegarLoop]: Abstraction has 530 states and 1916 transitions. [2023-10-12 17:12:12,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:12:12,089 INFO L430 stractBuchiCegarLoop]: Abstraction has 530 states and 1916 transitions. [2023-10-12 17:12:12,089 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:12:12,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 1916 transitions. [2023-10-12 17:12:12,093 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 324 [2023-10-12 17:12:12,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:12,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:12,093 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:12,094 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:12:12,094 INFO L748 eck$LassoCheckResult]: Stem: 10367#[$Ultimate##0]don't care [60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x] 10295#[L8]don't care [91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0] 10297#[L8-1, L21]don't care [82] L8-1-->L29: Formula: (= v_twoThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork0_thidvar0=v_twoThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork0_thidvar0] 10387#[L21, L9, L29]don't care [69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[] 10291#[L22, L9, L29]don't care [85] L9-->L37: Formula: (= v_threeThread1of1ForFork1_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork1_thidvar0=v_threeThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork1_thidvar0] 9865#[L37, L22, L10, L29]don't care [71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 9867#[L21, L37, L10, L29]don't care [73] L37-->L38: Formula: (= 3 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 9709#[L21, L10, L38, L29]don't care [2023-10-12 17:12:12,094 INFO L750 eck$LassoCheckResult]: Loop: 9709#[L21, L10, L38, L29]don't care [75] L38-->L37: Formula: (= v_x_9 4) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 9713#[L21, L37, L10, L29]don't care [73] L37-->L38: Formula: (= 3 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 9709#[L21, L10, L38, L29]don't care [2023-10-12 17:12:12,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1841577348, now seen corresponding path program 1 times [2023-10-12 17:12:12,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144328518] [2023-10-12 17:12:12,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:12,126 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:12,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:12,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144328518] [2023-10-12 17:12:12,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144328518] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:12,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:12,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:12:12,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783369974] [2023-10-12 17:12:12,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:12,130 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:12,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,130 INFO L85 PathProgramCache]: Analyzing trace with hash 3359, now seen corresponding path program 1 times [2023-10-12 17:12:12,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302649417] [2023-10-12 17:12:12,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:12,155 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:12,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:12,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302649417] [2023-10-12 17:12:12,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302649417] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:12,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:12,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:12:12,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898558109] [2023-10-12 17:12:12,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:12,156 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:12:12,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:12,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:12:12,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:12:12,157 INFO L87 Difference]: Start difference. First operand 530 states and 1916 transitions. cyclomatic complexity: 1504 Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:12,210 INFO L93 Difference]: Finished difference Result 659 states and 2270 transitions. [2023-10-12 17:12:12,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 659 states and 2270 transitions. [2023-10-12 17:12:12,216 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 230 [2023-10-12 17:12:12,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 659 states to 463 states and 1524 transitions. [2023-10-12 17:12:12,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 358 [2023-10-12 17:12:12,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 358 [2023-10-12 17:12:12,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 463 states and 1524 transitions. [2023-10-12 17:12:12,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:12,223 INFO L219 hiAutomatonCegarLoop]: Abstraction has 463 states and 1524 transitions. [2023-10-12 17:12:12,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states and 1524 transitions. [2023-10-12 17:12:12,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 379. [2023-10-12 17:12:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 379 states have (on average 3.390501319261214) internal successors, (1285), 378 states have internal predecessors, (1285), 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,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1285 transitions. [2023-10-12 17:12:12,235 INFO L241 hiAutomatonCegarLoop]: Abstraction has 379 states and 1285 transitions. [2023-10-12 17:12:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:12:12,238 INFO L430 stractBuchiCegarLoop]: Abstraction has 379 states and 1285 transitions. [2023-10-12 17:12:12,238 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:12:12,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 379 states and 1285 transitions. [2023-10-12 17:12:12,240 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 213 [2023-10-12 17:12:12,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:12,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:12,241 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:12,241 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-10-12 17:12:12,242 INFO L748 eck$LassoCheckResult]: Stem: 11549#[$Ultimate##0]don't care [60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x] 11317#[L8]don't care [91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0] 11319#[L8-1, L21]don't care [82] L8-1-->L29: Formula: (= v_twoThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork0_thidvar0=v_twoThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork0_thidvar0] 11631#[L21, L9, L29]don't care [69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[] 11287#[L22, L9, L29]don't care [85] L9-->L37: Formula: (= v_threeThread1of1ForFork1_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork1_thidvar0=v_threeThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork1_thidvar0] 11537#[L37, L22, L10, L29]don't care [71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 11655#[L21, L37, L10, L29]don't care [88] L10-->L45: Formula: (= v_fourThread1of1ForFork2_thidvar0_2 4) InVars {} OutVars{fourThread1of1ForFork2_thidvar0=v_fourThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[fourThread1of1ForFork2_thidvar0] 11989#[L21, L29, L11, L37, L45]don't care [65] L45-->L46: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 11475#[L21, L29, L11, L37, L46]don't care [2023-10-12 17:12:12,242 INFO L750 eck$LassoCheckResult]: Loop: 11475#[L21, L29, L11, L37, L46]don't care [67] L46-->L45: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 11477#[L21, L29, L11, L37, L45]don't care [69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[] 11615#[L29, L11, L22, L37, L45]don't care [71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 11909#[L21, L29, L11, L37, L45]don't care [65] L45-->L46: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 11475#[L21, L29, L11, L37, L46]don't care [2023-10-12 17:12:12,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1254323470, now seen corresponding path program 1 times [2023-10-12 17:12:12,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24466861] [2023-10-12 17:12:12,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:12,273 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:12,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:12,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24466861] [2023-10-12 17:12:12,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24466861] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:12,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:12,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:12:12,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381525427] [2023-10-12 17:12:12,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:12,275 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:12,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2988093, now seen corresponding path program 1 times [2023-10-12 17:12:12,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722757391] [2023-10-12 17:12:12,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:12,299 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:12,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:12,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722757391] [2023-10-12 17:12:12,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722757391] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:12,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:12,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:12:12,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160587454] [2023-10-12 17:12:12,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:12,300 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:12:12,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:12,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:12:12,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:12:12,301 INFO L87 Difference]: Start difference. First operand 379 states and 1285 transitions. cyclomatic complexity: 984 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:12,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:12,339 INFO L93 Difference]: Finished difference Result 433 states and 1379 transitions. [2023-10-12 17:12:12,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 1379 transitions. [2023-10-12 17:12:12,343 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 202 [2023-10-12 17:12:12,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 397 states and 1261 transitions. [2023-10-12 17:12:12,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 323 [2023-10-12 17:12:12,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 323 [2023-10-12 17:12:12,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 397 states and 1261 transitions. [2023-10-12 17:12:12,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:12,348 INFO L219 hiAutomatonCegarLoop]: Abstraction has 397 states and 1261 transitions. [2023-10-12 17:12:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states and 1261 transitions. [2023-10-12 17:12:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 340. [2023-10-12 17:12:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 340 states have (on average 3.1735294117647057) internal successors, (1079), 339 states have internal predecessors, (1079), 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,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1079 transitions. [2023-10-12 17:12:12,356 INFO L241 hiAutomatonCegarLoop]: Abstraction has 340 states and 1079 transitions. [2023-10-12 17:12:12,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:12:12,357 INFO L430 stractBuchiCegarLoop]: Abstraction has 340 states and 1079 transitions. [2023-10-12 17:12:12,357 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:12:12,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 340 states and 1079 transitions. [2023-10-12 17:12:12,359 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 183 [2023-10-12 17:12:12,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:12,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:12,360 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:12,360 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-10-12 17:12:12,360 INFO L748 eck$LassoCheckResult]: Stem: 12735#[$Ultimate##0]don't care [60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x] 12501#[L8]don't care [91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0] 12503#[L8-1, L21]don't care [82] L8-1-->L29: Formula: (= v_twoThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork0_thidvar0=v_twoThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork0_thidvar0] 12841#[L21, L9, L29]don't care [69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[] 12481#[L22, L9, L29]don't care [71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 12725#[L21, L9, L29]don't care [77] L29-->L30: Formula: (= v_x_11 2) InVars {x=v_x_11} OutVars{x=v_x_11} AuxVars[] AssignedVars[] 12809#[L21, L9, L30]don't care [69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[] 12955#[L22, L9, L30]don't care [79] L30-->L29: Formula: (= v_x_12 3) InVars {} OutVars{x=v_x_12} AuxVars[] AssignedVars[x] 13017#[L22, L9, L29]don't care [2023-10-12 17:12:12,360 INFO L750 eck$LassoCheckResult]: Loop: 13017#[L22, L9, L29]don't care [71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 12719#[L21, L9, L29]don't care [77] L29-->L30: Formula: (= v_x_11 2) InVars {x=v_x_11} OutVars{x=v_x_11} AuxVars[] AssignedVars[] 13015#[L21, L9, L30]don't care [69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[] 13013#[L22, L9, L30]don't care [79] L30-->L29: Formula: (= v_x_12 3) InVars {} OutVars{x=v_x_12} AuxVars[] AssignedVars[x] 13017#[L22, L9, L29]don't care [2023-10-12 17:12:12,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1253911587, now seen corresponding path program 1 times [2023-10-12 17:12:12,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868290373] [2023-10-12 17:12:12,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:12,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:12,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868290373] [2023-10-12 17:12:12,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868290373] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:12,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:12,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:12:12,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012144690] [2023-10-12 17:12:12,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:12,388 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:12,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash 3114897, now seen corresponding path program 1 times [2023-10-12 17:12:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755485207] [2023-10-12 17:12:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:12,400 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:12,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:12,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755485207] [2023-10-12 17:12:12,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755485207] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:12,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:12,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:12:12,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430609404] [2023-10-12 17:12:12,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:12,401 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:12:12,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:12,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:12:12,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:12:12,402 INFO L87 Difference]: Start difference. First operand 340 states and 1079 transitions. cyclomatic complexity: 812 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:12,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:12,451 INFO L93 Difference]: Finished difference Result 349 states and 974 transitions. [2023-10-12 17:12:12,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 974 transitions. [2023-10-12 17:12:12,454 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 56 [2023-10-12 17:12:12,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 104 states and 236 transitions. [2023-10-12 17:12:12,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2023-10-12 17:12:12,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2023-10-12 17:12:12,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 236 transitions. [2023-10-12 17:12:12,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:12:12,458 INFO L219 hiAutomatonCegarLoop]: Abstraction has 104 states and 236 transitions. [2023-10-12 17:12:12,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 236 transitions. [2023-10-12 17:12:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 83. [2023-10-12 17:12:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 2.36144578313253) internal successors, (196), 82 states have internal predecessors, (196), 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,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 196 transitions. [2023-10-12 17:12:12,461 INFO L241 hiAutomatonCegarLoop]: Abstraction has 83 states and 196 transitions. [2023-10-12 17:12:12,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:12:12,462 INFO L430 stractBuchiCegarLoop]: Abstraction has 83 states and 196 transitions. [2023-10-12 17:12:12,463 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:12:12,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 196 transitions. [2023-10-12 17:12:12,463 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 55 [2023-10-12 17:12:12,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:12,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:12,464 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:12:12,464 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:12:12,464 INFO L748 eck$LassoCheckResult]: Stem: 13633#[$Ultimate##0]don't care [60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x] 13539#[L8]don't care [91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0] 13541#[L8-1, L21]don't care [82] L8-1-->L29: Formula: (= v_twoThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork0_thidvar0=v_twoThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork0_thidvar0] 13647#[L21, L9, L29]don't care [85] L9-->L37: Formula: (= v_threeThread1of1ForFork1_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork1_thidvar0=v_threeThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork1_thidvar0] 13645#[L21, L37, L10, L29]don't care [88] L10-->L45: Formula: (= v_fourThread1of1ForFork2_thidvar0_2 4) InVars {} OutVars{fourThread1of1ForFork2_thidvar0=v_fourThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[fourThread1of1ForFork2_thidvar0] 13609#[L21, L29, L11, L37, L45]don't care [2023-10-12 17:12:12,464 INFO L750 eck$LassoCheckResult]: Loop: 13609#[L21, L29, L11, L37, L45]don't care [69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[] 13527#[L29, L11, L22, L37, L45]don't care [71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 13565#[L21, L29, L11, L37, L45]don't care [77] L29-->L30: Formula: (= v_x_11 2) InVars {x=v_x_11} OutVars{x=v_x_11} AuxVars[] AssignedVars[] 13603#[L21, L11, L30, L37, L45]don't care [79] L30-->L29: Formula: (= v_x_12 3) InVars {} OutVars{x=v_x_12} AuxVars[] AssignedVars[x] 13627#[L21, L29, L11, L37, L45]don't care [65] L45-->L46: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 13607#[L21, L29, L11, L37, L46]don't care [67] L46-->L45: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 13609#[L21, L29, L11, L37, L45]don't care [2023-10-12 17:12:12,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,465 INFO L85 PathProgramCache]: Analyzing trace with hash 86832917, now seen corresponding path program 1 times [2023-10-12 17:12:12,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796597747] [2023-10-12 17:12:12,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1364110297, now seen corresponding path program 1 times [2023-10-12 17:12:12,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681372770] [2023-10-12 17:12:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:12,514 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:12,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:12,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681372770] [2023-10-12 17:12:12,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681372770] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:12,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:12,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:12:12,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029078542] [2023-10-12 17:12:12,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:12,515 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:12:12,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:12,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:12:12,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:12:12,516 INFO L87 Difference]: Start difference. First operand 83 states and 196 transitions. cyclomatic complexity: 118 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:12,530 INFO L93 Difference]: Finished difference Result 45 states and 79 transitions. [2023-10-12 17:12:12,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 79 transitions. [2023-10-12 17:12:12,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-10-12 17:12:12,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 25 states and 37 transitions. [2023-10-12 17:12:12,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-10-12 17:12:12,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-10-12 17:12:12,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 37 transitions. [2023-10-12 17:12:12,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:12:12,531 INFO L219 hiAutomatonCegarLoop]: Abstraction has 25 states and 37 transitions. [2023-10-12 17:12:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 37 transitions. [2023-10-12 17:12:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-10-12 17:12:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 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,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2023-10-12 17:12:12,532 INFO L241 hiAutomatonCegarLoop]: Abstraction has 25 states and 37 transitions. [2023-10-12 17:12:12,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:12:12,532 INFO L430 stractBuchiCegarLoop]: Abstraction has 25 states and 37 transitions. [2023-10-12 17:12:12,532 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:12:12,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 37 transitions. [2023-10-12 17:12:12,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-10-12 17:12:12,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:12,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:12,533 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:12:12,533 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:12,533 INFO L748 eck$LassoCheckResult]: Stem: 13752#[$Ultimate##0]don't care [60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x] 13736#[L8]don't care [91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0] 13738#[L8-1, L21]don't care [82] L8-1-->L29: Formula: (= v_twoThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork0_thidvar0=v_twoThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork0_thidvar0] 13726#[L21, L9, L29]don't care [85] L9-->L37: Formula: (= v_threeThread1of1ForFork1_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork1_thidvar0=v_threeThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork1_thidvar0] 13728#[L21, L37, L10, L29]don't care [88] L10-->L45: Formula: (= v_fourThread1of1ForFork2_thidvar0_2 4) InVars {} OutVars{fourThread1of1ForFork2_thidvar0=v_fourThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[fourThread1of1ForFork2_thidvar0] 13708#[L21, L29, L11, L37, L45]don't care [2023-10-12 17:12:12,533 INFO L750 eck$LassoCheckResult]: Loop: 13708#[L21, L29, L11, L37, L45]don't care [69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[] 13710#[L29, L11, L22, L37, L45]don't care [71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 13732#[L21, L29, L11, L37, L45]don't care [77] L29-->L30: Formula: (= v_x_11 2) InVars {x=v_x_11} OutVars{x=v_x_11} AuxVars[] AssignedVars[] 13742#[L21, L11, L30, L37, L45]don't care [79] L30-->L29: Formula: (= v_x_12 3) InVars {} OutVars{x=v_x_12} AuxVars[] AssignedVars[x] 13744#[L21, L29, L11, L37, L45]don't care [73] L37-->L38: Formula: (= 3 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 13722#[L21, L29, L11, L38, L45]don't care [75] L38-->L37: Formula: (= v_x_9 4) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 13740#[L21, L29, L11, L37, L45]don't care [65] L45-->L46: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 13712#[L21, L29, L11, L37, L46]don't care [67] L46-->L45: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 13708#[L21, L29, L11, L37, L45]don't care [2023-10-12 17:12:12,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,534 INFO L85 PathProgramCache]: Analyzing trace with hash 86832917, now seen corresponding path program 2 times [2023-10-12 17:12:12,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629102438] [2023-10-12 17:12:12,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,538 INFO L85 PathProgramCache]: Analyzing trace with hash -944722039, now seen corresponding path program 1 times [2023-10-12 17:12:12,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323416942] [2023-10-12 17:12:12,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2102350493, now seen corresponding path program 1 times [2023-10-12 17:12:12,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745115459] [2023-10-12 17:12:12,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,639 INFO L201 PluginConnector]: Adding new model Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:12:12 BoogieIcfgContainer [2023-10-12 17:12:12,639 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:12:12,641 INFO L158 Benchmark]: Toolchain (without parser) took 3012.91ms. Allocated memory was 168.8MB in the beginning and 213.9MB in the end (delta: 45.1MB). Free memory was 122.2MB in the beginning and 173.8MB in the end (delta: -51.5MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:12,644 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.29ms. Allocated memory is still 168.8MB. Free memory was 123.2MB in the beginning and 123.2MB in the end (delta: 58.5kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:12,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.30ms. Allocated memory is still 168.8MB. Free memory was 122.1MB in the beginning and 120.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:12:12,644 INFO L158 Benchmark]: Boogie Preprocessor took 17.58ms. Allocated memory is still 168.8MB. Free memory was 120.5MB in the beginning and 119.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:12,645 INFO L158 Benchmark]: RCFGBuilder took 188.40ms. Allocated memory is still 168.8MB. Free memory was 119.4MB in the beginning and 110.2MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:12:12,645 INFO L158 Benchmark]: BuchiAutomizer took 2776.03ms. Allocated memory was 168.8MB in the beginning and 213.9MB in the end (delta: 45.1MB). Free memory was 110.2MB in the beginning and 173.8MB in the end (delta: -63.6MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:12,646 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.29ms. Allocated memory is still 168.8MB. Free memory was 123.2MB in the beginning and 123.2MB in the end (delta: 58.5kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.30ms. Allocated memory is still 168.8MB. Free memory was 122.1MB in the beginning and 120.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.58ms. Allocated memory is still 168.8MB. Free memory was 120.5MB in the beginning and 119.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 188.40ms. Allocated memory is still 168.8MB. Free memory was 119.4MB in the beginning and 110.2MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2776.03ms. Allocated memory was 168.8MB in the beginning and 213.9MB in the end (delta: 45.1MB). Free memory was 110.2MB in the beginning and 173.8MB in the end (delta: -63.6MB). There was no memory consumed. 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 8 terminating modules (6 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 3 + -2 * x and consists of 4 locations. One deterministic module has affine ranking function 5 + -2 * x and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 1.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 1412 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 215 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 79 mSDtfsCounter, 540 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT1 conc0 concLT0 SILN0 SILU0 SILI3 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq200 hnf87 smp100 dnf100 smp100 tf114 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 94ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 21]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 one(); VAL [x=1] [L9] FORK 0 fork 2 two(); VAL [x=1] [L10] FORK 0 fork 3 three(); VAL [x=1] [L11] FORK 0 fork 4 four(); VAL [x=1] Loop: [L21] COND TRUE x == 1 [L22] x := 2; [L29] COND TRUE x == 2 [L30] x := 3; [L37] COND TRUE x == 3 [L38] x := 4; [L45] COND TRUE x == 4 [L46] x := 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 one(); VAL [x=1] [L9] FORK 0 fork 2 two(); VAL [x=1] [L10] FORK 0 fork 3 three(); VAL [x=1] [L11] FORK 0 fork 4 four(); VAL [x=1] Loop: [L21] COND TRUE x == 1 [L22] x := 2; [L29] COND TRUE x == 2 [L30] x := 3; [L37] COND TRUE x == 3 [L38] x := 4; [L45] COND TRUE x == 4 [L46] 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, 35 PlacesBefore, 31 PlacesAfterwards, 38 TransitionsBefore, 34 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 936 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 412, independent: 376, independent conditional: 0, independent unconditional: 376, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 285, independent: 270, independent conditional: 0, independent unconditional: 270, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 285, independent: 259, independent conditional: 0, independent unconditional: 259, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 412, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 285, unknown conditional: 0, unknown unconditional: 285] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...