/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 RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_FiveToOne_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:36:39,419 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:36:39,921 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:36:39,939 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:36:39,939 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:36:39,940 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:36:39,941 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:36:39,941 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:36:39,941 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:36:39,941 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:36:39,942 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:36:39,942 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:36:39,942 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:36:39,943 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:36:39,943 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:36:39,943 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:36:39,944 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:36:39,944 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:36:39,944 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:36:39,945 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:36:39,945 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:36:39,949 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:36:39,949 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:36:39,949 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:36:39,950 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:36:39,950 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:36:39,950 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:36:39,950 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:36:39,951 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:36:39,951 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:36:39,951 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:36:39,951 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:36:39,952 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:36:39,953 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:36:39,953 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 -> RABIN_PETRI_NET [2023-10-12 17:36:40,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:36:40,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:36:40,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:36:40,229 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:36:40,230 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:36:40,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_FiveToOne_nonterminating.bpl [2023-10-12 17:36:40,232 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_FiveToOne_nonterminating.bpl' [2023-10-12 17:36:40,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:36:40,253 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:36:40,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:40,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:36:40,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:36:40,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,279 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:36:40,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:40,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:36:40,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:36:40,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:36:40,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,293 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:36:40,300 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:36:40,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:36:40,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:36:40,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/1) ... [2023-10-12 17:36:40,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:40,334 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:36:40,361 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:36:40,379 INFO L124 BoogieDeclarations]: Specification and implementation of procedure once given in one single declaration [2023-10-12 17:36:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure once [2023-10-12 17:36:40,380 INFO L138 BoogieDeclarations]: Found implementation of procedure once [2023-10-12 17:36:40,380 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:36:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:36:40,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:36:40,380 INFO L124 BoogieDeclarations]: Specification and implementation of procedure five given in one single declaration [2023-10-12 17:36:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure five [2023-10-12 17:36:40,381 INFO L138 BoogieDeclarations]: Found implementation of procedure five [2023-10-12 17:36:40,382 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:36:40,425 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:36:40,426 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:36:40,503 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:36:40,510 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:36:40,510 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:36:40,516 INFO L201 PluginConnector]: Adding new model concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:40 BoogieIcfgContainer [2023-10-12 17:36:40,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:36:40,518 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:36:40,518 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:36:40,522 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:36:40,522 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:40,522 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:40" (1/2) ... [2023-10-12 17:36:40,525 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b1caa17 and model type concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:36:40, skipping insertion in model container [2023-10-12 17:36:40,525 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:40,525 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:40" (2/2) ... [2023-10-12 17:36:40,529 INFO L332 chiAutomizerObserver]: Analyzing ICFG concurrent_FiveToOne_nonterminating.bpl [2023-10-12 17:36:40,595 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:36:40,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 20 transitions, 62 flow [2023-10-12 17:36:40,649 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-10-12 17:36:40,650 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:36:40,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 3/16 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2023-10-12 17:36:40,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 20 transitions, 62 flow [2023-10-12 17:36:40,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 16 transitions, 50 flow [2023-10-12 17:36:40,672 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:36:40,684 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 16 transitions, 50 flow [2023-10-12 17:36:40,697 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 16 transitions, 50 flow [2023-10-12 17:36:40,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 50 flow [2023-10-12 17:36:40,702 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-10-12 17:36:40,702 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:36:40,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 3/16 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2023-10-12 17:36:40,703 INFO L119 LiptonReduction]: Number of co-enabled transitions 56 [2023-10-12 17:36:40,827 INFO L134 LiptonReduction]: Checked pairs total: 90 [2023-10-12 17:36:40,827 INFO L136 LiptonReduction]: Total number of compositions: 4 [2023-10-12 17:36:40,839 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:36:40,839 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:36:40,839 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:36:40,839 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:36:40,839 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:36:40,839 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:36:40,839 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:36:40,840 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:36:40,840 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 15 places, 12 transitions, 42 flow [2023-10-12 17:36:40,843 ERROR L47 etriNetUnfolderRabin]: [1:1A:[31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][4], 2:2A:[44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0][2]][3:3A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][10]] [2023-10-12 17:36:40,845 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:40,845 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:36:40,845 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:40,845 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:40,847 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:36:40,847 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 15 places, 12 transitions, 42 flow [2023-10-12 17:36:40,848 ERROR L47 etriNetUnfolderRabin]: [1:1A:[31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][4], 2:2A:[44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0][2]][3:3A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][10]] [2023-10-12 17:36:40,849 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:40,849 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:36:40,849 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:40,849 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:40,853 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 27#[L8]true [44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0] 29#[L17, L8-1]true [2023-10-12 17:36:40,853 INFO L750 eck$LassoCheckResult]: Loop: 29#[L17, L8-1]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 29#[L17, L8-1]true [2023-10-12 17:36:40,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:40,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1966, now seen corresponding path program 1 times [2023-10-12 17:36:40,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:40,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648424063] [2023-10-12 17:36:40,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:40,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:40,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:40,937 INFO L85 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 1 times [2023-10-12 17:36:40,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:40,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600656973] [2023-10-12 17:36:40,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:40,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:40,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash 61000, now seen corresponding path program 1 times [2023-10-12 17:36:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:40,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720307188] [2023-10-12 17:36:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:41,001 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,002 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,002 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,002 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,002 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:41,003 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,003 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,003 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,003 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:36:41,003 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,003 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,016 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:36:41,052 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,052 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:41,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,065 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:36:41,068 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:36:41,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:41,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,107 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:36:41,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,113 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:36:41,116 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:36:41,118 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:41,119 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,145 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:41,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:41,153 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,153 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,153 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,153 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,153 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:41,153 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,153 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,153 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,153 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:36:41,154 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,154 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,155 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:36:41,175 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,179 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:41,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,181 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:36:41,192 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:36:41,200 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:36:41,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:41,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:41,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:41,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:41,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:41,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:41,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:41,218 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:41,224 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:41,225 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:41,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,231 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:36:41,253 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:36:41,253 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:41,254 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:41,254 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:41,255 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 7 Supporting invariants [] [2023-10-12 17:36:41,261 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:36:41,265 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:41,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,319 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,320 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:36:41,363 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:36:41,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2023-10-12 17:36:41,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:36:41,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:36:41,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:36:41,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,451 INFO L430 stractBuchiCegarLoop]: Abstraction has has 19 places, 48 transitions, 264 flow [2023-10-12 17:36:41,451 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:36:41,452 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 19 places, 48 transitions, 264 flow [2023-10-12 17:36:41,456 ERROR L47 etriNetUnfolderRabin]: [1:1A:[31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][17], 2:2A:[44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0][9], 4:3A:[47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0][14], 15:4A:[55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x][47]][17:5A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][40]] [2023-10-12 17:36:41,456 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:41,456 INFO L124 PetriNetUnfolderBase]: 8/16 cut-off events. [2023-10-12 17:36:41,456 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:36:41,456 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:41,460 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 27#[L8]true [44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0] 29#[L17, L8-1]true [47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0] 65#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [2023-10-12 17:36:41,460 INFO L750 eck$LassoCheckResult]: Loop: 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [2023-10-12 17:36:41,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1890838, now seen corresponding path program 1 times [2023-10-12 17:36:41,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173351594] [2023-10-12 17:36:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,521 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:36:41,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:41,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173351594] [2023-10-12 17:36:41,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173351594] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:41,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:41,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:36:41,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966627211] [2023-10-12 17:36:41,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:41,525 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:36:41,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 2 times [2023-10-12 17:36:41,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347878670] [2023-10-12 17:36:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:41,556 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,556 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,556 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,557 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,557 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:41,557 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,557 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,557 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,557 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:36:41,557 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,557 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,560 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:36:41,579 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,579 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:41,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,581 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:36:41,588 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:36:41,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:41,589 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,602 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:36:41,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,603 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:36:41,605 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:36:41,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:41,607 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,624 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:41,629 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:36:41,631 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,631 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,631 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,631 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,631 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:41,631 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,631 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,631 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,632 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:36:41,632 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,632 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,633 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:36:41,650 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,650 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:41,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,652 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:36:41,661 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:36:41,662 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:36:41,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:41,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:41,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:41,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:41,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:41,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:41,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:41,676 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:41,678 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:41,678 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:41,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,681 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:36:41,681 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:36:41,683 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:41,683 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:41,683 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:41,683 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 7 Supporting invariants [] [2023-10-12 17:36:41,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:36:41,690 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:41,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,736 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,737 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:36:41,738 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:36:41,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:41,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2023-10-12 17:36:41,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:36:41,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:36:41,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:36:41,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:41,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:36:41,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:36:41,807 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 23 places, 192 transitions, 1440 flow. 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:36:41,807 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:41,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:41,861 INFO L124 PetriNetUnfolderBase]: 48/111 cut-off events. [2023-10-12 17:36:41,862 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-10-12 17:36:41,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 111 events. 48/111 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 326 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 319. Up to 76 conditions per place. [2023-10-12 17:36:41,865 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 52 selfloop transitions, 11 changer transitions 0/63 dead transitions. [2023-10-12 17:36:41,865 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 25 places, 63 transitions, 588 flow [2023-10-12 17:36:41,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:36:41,867 INFO L430 stractBuchiCegarLoop]: Abstraction has has 25 places, 63 transitions, 588 flow [2023-10-12 17:36:41,867 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:36:41,867 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 63 transitions, 588 flow [2023-10-12 17:36:41,879 ERROR L47 etriNetUnfolderRabin]: [1:1A:[31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0][1], 3:3A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][2], 7:4A:[47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0][6], 20:5A:[55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x][11], 33:6A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][19], 51:7A:[55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x][26], 69:8A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][39]][70:9A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][47]] [2023-10-12 17:36:41,879 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:41,879 INFO L124 PetriNetUnfolderBase]: 31/69 cut-off events. [2023-10-12 17:36:41,880 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-10-12 17:36:41,880 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:41,880 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 27#[L8]true [44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0] 29#[L17, L8-1]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 29#[L17, L8-1]true [47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0] 65#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [2023-10-12 17:36:41,881 INFO L750 eck$LassoCheckResult]: Loop: 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [2023-10-12 17:36:41,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1628380827, now seen corresponding path program 1 times [2023-10-12 17:36:41,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776878652] [2023-10-12 17:36:41,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:36:41,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:41,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776878652] [2023-10-12 17:36:41,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776878652] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:41,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:41,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:36:41,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845858759] [2023-10-12 17:36:41,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:41,924 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:36:41,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 3 times [2023-10-12 17:36:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799105302] [2023-10-12 17:36:41,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:41,941 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,941 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,941 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,941 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,941 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:41,942 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,942 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,942 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,942 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:36:41,942 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,942 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,943 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:36:41,970 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:36:41,974 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:36:41,984 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,984 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:41,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,985 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:41,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:36:41,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:41,989 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:42,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:42,001 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:42,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:36:42,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:42,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:42,025 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:42,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:42,032 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:42,032 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:42,032 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:42,032 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:42,032 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:42,032 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,032 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:42,032 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:42,033 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:36:42,033 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:42,033 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:42,033 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:36:42,059 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:42,059 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:42,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:42,061 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:42,073 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:36:42,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:36:42,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:42,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:42,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:42,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:42,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:42,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:42,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:42,092 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:42,094 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:42,095 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:42,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:42,096 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:42,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:36:42,107 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:42,107 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:42,107 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:42,107 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 7 Supporting invariants [] [2023-10-12 17:36:42,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:42,115 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:42,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,152 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,153 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:36:42,153 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:36:42,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2023-10-12 17:36:42,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:36:42,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,204 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:36:42,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,256 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,256 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:36:42,257 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:36:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2023-10-12 17:36:42,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:36:42,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,309 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:36:42,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,348 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,348 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:36:42,350 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:36:42,351 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:42,412 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 4 states and 112 transitions. [2023-10-12 17:36:42,414 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:36:42,422 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:36:42,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2023-10-12 17:36:42,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:36:42,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:36:42,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:36:42,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:42,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:36:42,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:36:42,427 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 33 places, 566 transitions, 6500 flow. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:42,427 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:42,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:42,552 INFO L124 PetriNetUnfolderBase]: 98/255 cut-off events. [2023-10-12 17:36:42,553 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-10-12 17:36:42,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1644 conditions, 255 events. 98/255 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1110 event pairs, 1 based on Foata normal form. 11/211 useless extension candidates. Maximal degree in co-relation 1132. Up to 207 conditions per place. [2023-10-12 17:36:42,556 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 118 selfloop transitions, 28 changer transitions 29/175 dead transitions. [2023-10-12 17:36:42,556 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 35 places, 175 transitions, 2346 flow [2023-10-12 17:36:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:36:42,557 INFO L430 stractBuchiCegarLoop]: Abstraction has has 35 places, 175 transitions, 2346 flow [2023-10-12 17:36:42,557 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:36:42,557 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 35 places, 175 transitions, 2346 flow [2023-10-12 17:36:42,576 ERROR L47 etriNetUnfolderRabin]: [1:1A:[31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0][1], 3:3A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][2], 5:4A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][4], 18:5A:[47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0][13], 37:6A:[55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x][28], 65:7A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][43], 97:8A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][56], 125:9A:[55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x][74]][158:10A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][95], 181:11A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][112], 182:12A:[55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x][134]] [2023-10-12 17:36:42,577 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:42,577 INFO L124 PetriNetUnfolderBase]: 70/181 cut-off events. [2023-10-12 17:36:42,577 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2023-10-12 17:36:42,577 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:42,578 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 27#[L8]true [44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0] 29#[L17, L8-1]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 29#[L17, L8-1]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 29#[L17, L8-1]true [47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0] 65#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [2023-10-12 17:36:42,578 INFO L750 eck$LassoCheckResult]: Loop: 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [2023-10-12 17:36:42,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1252846689, now seen corresponding path program 2 times [2023-10-12 17:36:42,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:42,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101894859] [2023-10-12 17:36:42,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:36:42,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:42,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101894859] [2023-10-12 17:36:42,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101894859] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:36:42,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936692262] [2023-10-12 17:36:42,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:36:42,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:36:42,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:42,618 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:36:42,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-10-12 17:36:42,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:36:42,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:36:42,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:36:42,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:36:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:36:42,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936692262] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:36:42,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:36:42,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-10-12 17:36:42,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110655640] [2023-10-12 17:36:42,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:36:42,723 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:36:42,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,723 INFO L85 PathProgramCache]: Analyzing trace with hash 83414, now seen corresponding path program 1 times [2023-10-12 17:36:42,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:42,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650627040] [2023-10-12 17:36:42,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:42,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:42,765 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:42,766 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:42,766 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:42,766 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:42,766 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:42,766 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,766 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:42,766 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:42,766 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration4_Loop [2023-10-12 17:36:42,766 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:42,766 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:42,767 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:36:42,783 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:42,783 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:42,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:42,784 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:42,790 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:42,790 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:42,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:36:42,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:42,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:42,807 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:42,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:36:42,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:42,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:42,820 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:42,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-10-12 17:36:42,826 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:42,826 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:42,826 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:42,826 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:42,826 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:42,826 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,826 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:42,827 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:42,827 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration4_Loop [2023-10-12 17:36:42,827 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:42,827 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:42,828 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:36:42,858 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:42,858 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:42,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:42,860 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:42,870 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:36:42,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:42,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:42,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:42,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:42,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:42,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:42,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:42,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:36:42,893 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:42,894 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:36:42,894 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:42,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:42,897 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:42,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:36:42,899 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:42,899 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:42,899 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:42,899 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2023-10-12 17:36:42,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:42,905 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:42,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,962 WARN L260 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:42,985 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-10-12 17:36:43,080 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:36:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2023-10-12 17:36:43,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 110 transitions. Stem has 9 letters. Loop has 3 letters. [2023-10-12 17:36:43,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:43,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 110 transitions. Stem has 12 letters. Loop has 3 letters. [2023-10-12 17:36:43,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:43,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 110 transitions. Stem has 9 letters. Loop has 6 letters. [2023-10-12 17:36:43,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:43,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:43,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:36:43,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:36:43,083 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 41 places, 1050 transitions, 16176 flow. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:43,083 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:43,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:43,212 INFO L124 PetriNetUnfolderBase]: 110/295 cut-off events. [2023-10-12 17:36:43,212 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2023-10-12 17:36:43,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 295 events. 110/295 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1259 event pairs, 0 based on Foata normal form. 11/244 useless extension candidates. Maximal degree in co-relation 1827. Up to 247 conditions per place. [2023-10-12 17:36:43,216 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 138 selfloop transitions, 34 changer transitions 32/204 dead transitions. [2023-10-12 17:36:43,216 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 45 places, 204 transitions, 3555 flow [2023-10-12 17:36:43,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:36:43,217 INFO L430 stractBuchiCegarLoop]: Abstraction has has 45 places, 204 transitions, 3555 flow [2023-10-12 17:36:43,217 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:36:43,217 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 45 places, 204 transitions, 3555 flow [2023-10-12 17:36:43,243 ERROR L47 etriNetUnfolderRabin]: [1:1A:[31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0][1], 3:3A:[47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0][2], 6:4A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][5], 14:5A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][11], 32:6A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][17], 59:7A:[55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x][37], 91:8A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][56], 122:9A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][71], 149:10A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][93], 172:11A:[55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x][110]][193:12A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][124], 213:13A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][137], 233:14A:[54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x][155], 234:15A:[55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x][170]] [2023-10-12 17:36:43,244 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:43,244 INFO L124 PetriNetUnfolderBase]: 86/233 cut-off events. [2023-10-12 17:36:43,244 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2023-10-12 17:36:43,244 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:43,245 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 27#[L8]true [44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0] 29#[L17, L8-1]true [47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [2023-10-12 17:36:43,245 INFO L750 eck$LassoCheckResult]: Loop: 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 65#[L9, L25, L17]true [2023-10-12 17:36:43,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:43,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1243009085, now seen corresponding path program 3 times [2023-10-12 17:36:43,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:43,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161421711] [2023-10-12 17:36:43,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:43,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:43,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:43,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2585858, now seen corresponding path program 2 times [2023-10-12 17:36:43,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:43,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921438161] [2023-10-12 17:36:43,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:43,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:43,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:43,266 INFO L85 PathProgramCache]: Analyzing trace with hash 982447044, now seen corresponding path program 4 times [2023-10-12 17:36:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:43,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239759715] [2023-10-12 17:36:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:43,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,393 INFO L201 PluginConnector]: Adding new model concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:36:43 BoogieIcfgContainer [2023-10-12 17:36:43,393 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:36:43,394 INFO L158 Benchmark]: Toolchain (without parser) took 3141.25ms. Allocated memory was 197.1MB in the beginning and 306.2MB in the end (delta: 109.1MB). Free memory was 150.4MB in the beginning and 134.1MB in the end (delta: 16.2MB). Peak memory consumption was 126.2MB. Max. memory is 8.0GB. [2023-10-12 17:36:43,394 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.35ms. Allocated memory is still 197.1MB. Free memory was 151.4MB in the beginning and 151.2MB in the end (delta: 180.5kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:36:43,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.16ms. Allocated memory is still 197.1MB. Free memory was 150.4MB in the beginning and 148.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:43,395 INFO L158 Benchmark]: Boogie Preprocessor took 17.17ms. Allocated memory is still 197.1MB. Free memory was 148.7MB in the beginning and 147.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:43,395 INFO L158 Benchmark]: RCFGBuilder took 216.44ms. Allocated memory is still 197.1MB. Free memory was 147.7MB in the beginning and 139.0MB in the end (delta: 8.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:36:43,396 INFO L158 Benchmark]: BuchiAutomizer took 2875.11ms. Allocated memory was 197.1MB in the beginning and 306.2MB in the end (delta: 109.1MB). Free memory was 139.0MB in the beginning and 134.1MB in the end (delta: 4.9MB). Peak memory consumption was 114.6MB. Max. memory is 8.0GB. [2023-10-12 17:36:43,397 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.35ms. Allocated memory is still 197.1MB. Free memory was 151.4MB in the beginning and 151.2MB in the end (delta: 180.5kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.16ms. Allocated memory is still 197.1MB. Free memory was 150.4MB in the beginning and 148.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.17ms. Allocated memory is still 197.1MB. Free memory was 148.7MB in the beginning and 147.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 216.44ms. Allocated memory is still 197.1MB. Free memory was 147.7MB in the beginning and 139.0MB in the end (delta: 8.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2875.11ms. Allocated memory was 197.1MB in the beginning and 306.2MB in the end (delta: 109.1MB). Free memory was 139.0MB in the beginning and 134.1MB in the end (delta: 4.9MB). Peak memory consumption was 114.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 7 + -2 * x and consists of 3 locations. One deterministic module has affine ranking function 7 + -2 * x and consists of 3 locations. One deterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function 7 + -2 * x and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 3555 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 1.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 398 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 392 mSDsluCounter, 199 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 352 IncrementalHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 147 mSDtfsCounter, 352 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital9 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq170 hnf92 smp100 dnf100 smp100 tf113 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 74ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 five(); VAL [x=1] [L9] FORK 0 fork 2 once(); VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=4] [L25] COND TRUE 2 x == 4 [L26] 2 x := 1; VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=4] [L25] COND TRUE 2 x == 4 [L26] 2 x := 1; VAL [x=1] Loop: [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L25] COND TRUE x == 4 [L26] x := 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 five(); VAL [x=1] [L9] FORK 0 fork 2 once(); VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=4] [L25] COND TRUE 2 x == 4 [L26] 2 x := 1; VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=4] [L25] COND TRUE 2 x == 4 [L26] 2 x := 1; VAL [x=1] Loop: [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L25] COND TRUE x == 4 [L26] x := 1; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 19 PlacesBefore, 15 PlacesAfterwards, 16 TransitionsBefore, 12 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 90 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 42, unknown conditional: 0, unknown unconditional: 42] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:36:43,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:43,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-10-12 17:36:43,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:44,018 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...