/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/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.fs.omega-petrinet-638c691-m [2022-09-29 15:00:20,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 15:00:20,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 15:00:20,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 15:00:20,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 15:00:20,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 15:00:20,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 15:00:20,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 15:00:20,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 15:00:20,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 15:00:20,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 15:00:20,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 15:00:20,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 15:00:20,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 15:00:20,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 15:00:20,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 15:00:20,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 15:00:20,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 15:00:20,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 15:00:20,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 15:00:20,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 15:00:20,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 15:00:20,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 15:00:20,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 15:00:20,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 15:00:20,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 15:00:20,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 15:00:20,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 15:00:20,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 15:00:20,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 15:00:20,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 15:00:20,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 15:00:20,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 15:00:20,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 15:00:20,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 15:00:20,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 15:00:20,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 15:00:20,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 15:00:20,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 15:00:20,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 15:00:20,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 15:00:20,307 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-09-29 15:00:20,321 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 15:00:20,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 15:00:20,322 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 15:00:20,322 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 15:00:20,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 15:00:20,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 15:00:20,323 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 15:00:20,323 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-09-29 15:00:20,323 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-09-29 15:00:20,323 INFO L138 SettingsManager]: * Use old map elimination=false [2022-09-29 15:00:20,323 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-09-29 15:00:20,323 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-09-29 15:00:20,323 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-09-29 15:00:20,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 15:00:20,324 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 15:00:20,324 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-09-29 15:00:20,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 15:00:20,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 15:00:20,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 15:00:20,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-09-29 15:00:20,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-09-29 15:00:20,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-09-29 15:00:20,324 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 15:00:20,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 15:00:20,325 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-09-29 15:00:20,325 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 15:00:20,325 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-09-29 15:00:20,325 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 15:00:20,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 15:00:20,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 15:00:20,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 15:00:20,326 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-09-29 15:00:20,326 INFO L138 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 [2022-09-29 15:00:20,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 15:00:20,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 15:00:20,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 15:00:20,504 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 15:00:20,507 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 15:00:20,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl [2022-09-29 15:00:20,508 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl' [2022-09-29 15:00:20,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 15:00:20,527 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-09-29 15:00:20,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-29 15:00:20,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-29 15:00:20,529 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-29 15:00:20,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,553 INFO L137 Inliner]: procedures = 3, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-09-29 15:00:20,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-29 15:00:20,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 15:00:20,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 15:00:20,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 15:00:20,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 15:00:20,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 15:00:20,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 15:00:20,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 15:00:20,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:20,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:20,594 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) [2022-09-29 15:00:20,600 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 [2022-09-29 15:00:20,621 INFO L124 BoogieDeclarations]: Specification and implementation of procedure reader given in one single declaration [2022-09-29 15:00:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-09-29 15:00:20,621 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-09-29 15:00:20,621 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-09-29 15:00:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 15:00:20,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 15:00:20,622 INFO L124 BoogieDeclarations]: Specification and implementation of procedure writer given in one single declaration [2022-09-29 15:00:20,622 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-09-29 15:00:20,622 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-09-29 15:00:20,623 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 15:00:20,670 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 15:00:20,672 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 15:00:20,767 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 15:00:20,772 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 15:00:20,772 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-29 15:00:20,774 INFO L202 PluginConnector]: Adding new model optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:00:20 BoogieIcfgContainer [2022-09-29 15:00:20,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 15:00:20,775 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-09-29 15:00:20,775 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-09-29 15:00:20,778 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-09-29 15:00:20,779 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:00:20,779 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/2) ... [2022-09-29 15:00:20,780 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e728c8f and model type optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.09 03:00:20, skipping insertion in model container [2022-09-29 15:00:20,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:00:20,781 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:00:20" (2/2) ... [2022-09-29 15:00:20,782 INFO L322 chiAutomizerObserver]: Analyzing ICFG optimistic-concurrency2.bpl [2022-09-29 15:00:20,877 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2022-09-29 15:00:20,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 116 flow [2022-09-29 15:00:20,938 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:00:20,938 INFO L123 PetriNetUnfolderBase]: 4/35 cut-off events. [2022-09-29 15:00:20,938 INFO L124 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2022-09-29 15:00:20,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 4/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2022-09-29 15:00:20,940 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 116 flow [2022-09-29 15:00:20,944 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 88 flow [2022-09-29 15:00:20,946 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 15:00:20,956 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 35 transitions, 88 flow [2022-09-29 15:00:20,957 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 35 transitions, 88 flow [2022-09-29 15:00:20,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 88 flow [2022-09-29 15:00:20,970 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:00:20,970 INFO L123 PetriNetUnfolderBase]: 4/35 cut-off events. [2022-09-29 15:00:20,970 INFO L124 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2022-09-29 15:00:20,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 4/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2022-09-29 15:00:20,971 INFO L116 LiptonReduction]: Number of co-enabled transitions 160 [2022-09-29 15:00:21,363 INFO L131 LiptonReduction]: Checked pairs total: 130 [2022-09-29 15:00:21,363 INFO L133 LiptonReduction]: Total number of compositions: 17 [2022-09-29 15:00:21,377 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 15:00:21,377 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 15:00:21,377 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 15:00:21,377 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 15:00:21,377 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 15:00:21,377 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 15:00:21,377 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 15:00:21,377 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-09-29 15:00:21,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-09-29 15:00:21,407 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-09-29 15:00:21,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:21,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:21,411 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-09-29 15:00:21,411 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:21,411 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 15:00:21,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 27 states, but on-demand construction may add more states [2022-09-29 15:00:21,416 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-09-29 15:00:21,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:21,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:21,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-09-29 15:00:21,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:21,419 INFO L733 eck$LassoCheckResult]: Stem: 47#[ULTIMATE.startENTRY]don't care [107] ULTIMATE.startENTRY-->L59: Formula: (and (<= v_ULTIMATE.start_max2_8 v_N_8) (<= 0 v_ULTIMATE.start_min2_8) (<= v_ULTIMATE.start_max1_6 v_N_8) (<= 0 v_ULTIMATE.start_min1_6)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_8, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_8, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} AuxVars[] AssignedVars[] 50#[L59]don't care [95] L59-->writerENTRY: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 52#[L59-1, writerENTRY]don't care [82] writerENTRY-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 56#[L59-1, L41-1]don't care [2022-09-29 15:00:21,420 INFO L735 eck$LassoCheckResult]: Loop: 56#[L59-1, L41-1]don't care [118] L41-1-->L41-1: Formula: (and (< v_writerThread1of1ForFork1_j_34 v_writerThread1of1ForFork1_end_13) (= v_A_20 (store v_A_21 v_writerThread1of1ForFork1_j_34 0)) (<= 0 v_writerThread1of1ForFork1_j_34) (<= v_writerThread1of1ForFork1_j_34 v_N_16) (= (+ v_writerThread1of1ForFork1_j_34 1) v_writerThread1of1ForFork1_j_33)) InVars {A=v_A_21, N=v_N_16, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_34, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_13} OutVars{A=v_A_20, N=v_N_16, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_33, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_13} AuxVars[] AssignedVars[A, writerThread1of1ForFork1_j] 56#[L59-1, L41-1]don't care [2022-09-29 15:00:21,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:21,423 INFO L85 PathProgramCache]: Analyzing trace with hash 135645, now seen corresponding path program 1 times [2022-09-29 15:00:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:21,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842265455] [2022-09-29 15:00:21,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:21,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:21,490 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:21,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:21,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:21,509 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2022-09-29 15:00:21,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:21,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594111162] [2022-09-29 15:00:21,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:21,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:21,520 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:21,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:21,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:21,535 INFO L85 PathProgramCache]: Analyzing trace with hash 4205113, now seen corresponding path program 1 times [2022-09-29 15:00:21,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:21,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14575522] [2022-09-29 15:00:21,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:21,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:21,553 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:21,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:21,697 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:00:21,699 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:00:21,699 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:00:21,699 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:00:21,699 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:00:21,699 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:21,699 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:00:21,699 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:00:21,699 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration1_Lasso [2022-09-29 15:00:21,700 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:00:21,700 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:00:21,710 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:21,760 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:21,768 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:21,831 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:00:21,834 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:00:21,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:21,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:21,842 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) [2022-09-29 15:00:21,844 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 [2022-09-29 15:00:21,845 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 [2022-09-29 15:00:21,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:21,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-09-29 15:00:21,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:21,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:21,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:21,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-09-29 15:00:21,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-09-29 15:00:21,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:21,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-09-29 15:00:21,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:21,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:21,904 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) [2022-09-29 15:00:21,943 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 [2022-09-29 15:00:21,946 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 [2022-09-29 15:00:21,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:21,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:21,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:21,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:21,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:21,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:21,980 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:00:21,998 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-09-29 15:00:21,999 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-09-29 15:00:22,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,002 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) [2022-09-29 15:00:22,025 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:00:22,033 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 [2022-09-29 15:00:22,041 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:00:22,041 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:00:22,042 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(writerThread1of1ForFork1_j, writerThread1of1ForFork1_end) = -1*writerThread1of1ForFork1_j + 1*writerThread1of1ForFork1_end Supporting invariants [] [2022-09-29 15:00:22,062 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 [2022-09-29 15:00:22,065 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:00:22,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:22,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:00:22,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:22,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-29 15:00:22,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:00:22,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 [2022-09-29 15:00:22,155 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 27 states, but on-demand construction may add more states Second operand has 2 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) [2022-09-29 15:00:22,220 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 27 states, but on-demand construction may add more states. Second operand has 2 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) Result 64 states and 148 transitions. Complement of second has 4 states. [2022-09-29 15:00:22,222 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 [2022-09-29 15:00:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 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) [2022-09-29 15:00:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-09-29 15:00:22,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 3 letters. Loop has 1 letters. [2022-09-29 15:00:22,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:22,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 4 letters. Loop has 1 letters. [2022-09-29 15:00:22,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:22,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 3 letters. Loop has 2 letters. [2022-09-29 15:00:22,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:22,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 148 transitions. [2022-09-29 15:00:22,231 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2022-09-29 15:00:22,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 41 states and 93 transitions. [2022-09-29 15:00:22,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-09-29 15:00:22,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-09-29 15:00:22,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 93 transitions. [2022-09-29 15:00:22,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-09-29 15:00:22,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 93 transitions. [2022-09-29 15:00:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 93 transitions. [2022-09-29 15:00:22,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-09-29 15:00:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 33 states have internal predecessors, (80), 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) [2022-09-29 15:00:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 80 transitions. [2022-09-29 15:00:22,253 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 80 transitions. [2022-09-29 15:00:22,253 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 80 transitions. [2022-09-29 15:00:22,254 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-09-29 15:00:22,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 80 transitions. [2022-09-29 15:00:22,254 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2022-09-29 15:00:22,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:22,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:22,255 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-09-29 15:00:22,255 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:22,255 INFO L733 eck$LassoCheckResult]: Stem: 206#[ULTIMATE.startENTRY]don't care [107] ULTIMATE.startENTRY-->L59: Formula: (and (<= v_ULTIMATE.start_max2_8 v_N_8) (<= 0 v_ULTIMATE.start_min2_8) (<= v_ULTIMATE.start_max1_6 v_N_8) (<= 0 v_ULTIMATE.start_min1_6)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_8, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_8, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} AuxVars[] AssignedVars[] 208#[L59]don't care [95] L59-->writerENTRY: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 214#[L59-1, writerENTRY]don't care [98] L59-1-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] 246#[readerENTRY, L60, writerENTRY]don't care [108] readerENTRY-->L28-1: Formula: (and (= v_readerThread1of1ForFork2_i_19 v_readerThread1of1ForFork2_start_5) (= v_readerThread1of1ForFork2_sum_13 0)) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_5} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_13, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_19, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i] 228#[L60, L28-1, writerENTRY]don't care [2022-09-29 15:00:22,256 INFO L735 eck$LassoCheckResult]: Loop: 228#[L60, L28-1, writerENTRY]don't care [119] L28-1-->L28-1: Formula: (and (< v_readerThread1of1ForFork2_i_32 v_readerThread1of1ForFork2_end_11) (= (+ v_readerThread1of1ForFork2_i_32 1) v_readerThread1of1ForFork2_i_31) (<= v_readerThread1of1ForFork2_i_32 v_N_18) (= v_readerThread1of1ForFork2_sum_27 (+ (select v_A_24 v_readerThread1of1ForFork2_i_32) v_readerThread1of1ForFork2_sum_28)) (<= 0 v_readerThread1of1ForFork2_i_32)) InVars {A=v_A_24, N=v_N_18, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_28, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_32, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_11} OutVars{A=v_A_24, N=v_N_18, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_27, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_31, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i] 228#[L60, L28-1, writerENTRY]don't care [2022-09-29 15:00:22,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:22,256 INFO L85 PathProgramCache]: Analyzing trace with hash 4205599, now seen corresponding path program 1 times [2022-09-29 15:00:22,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:22,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892798418] [2022-09-29 15:00:22,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:22,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,261 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:22,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash 150, now seen corresponding path program 1 times [2022-09-29 15:00:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:22,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51638958] [2022-09-29 15:00:22,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:22,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,270 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:22,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:22,274 INFO L85 PathProgramCache]: Analyzing trace with hash 130373688, now seen corresponding path program 1 times [2022-09-29 15:00:22,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:22,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040635487] [2022-09-29 15:00:22,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:22,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,280 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:22,369 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:00:22,369 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:00:22,369 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:00:22,370 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:00:22,370 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:00:22,370 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,370 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:00:22,370 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:00:22,370 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration2_Lasso [2022-09-29 15:00:22,370 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:00:22,370 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:00:22,371 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,374 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,378 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,381 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,383 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,400 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,489 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:00:22,489 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:00:22,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,492 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) [2022-09-29 15:00:22,506 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 [2022-09-29 15:00:22,506 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 [2022-09-29 15:00:22,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:22,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:22,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:22,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:22,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:22,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:22,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:22,562 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 [2022-09-29 15:00:22,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,568 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) [2022-09-29 15:00:22,573 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 [2022-09-29 15:00:22,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:22,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:22,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:22,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:22,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:22,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:22,591 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 [2022-09-29 15:00:22,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:22,621 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 [2022-09-29 15:00:22,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,640 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) [2022-09-29 15:00:22,644 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 [2022-09-29 15:00:22,645 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 [2022-09-29 15:00:22,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:22,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-09-29 15:00:22,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:22,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:22,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:22,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-09-29 15:00:22,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-09-29 15:00:22,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:22,681 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 [2022-09-29 15:00:22,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,682 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) [2022-09-29 15:00:22,683 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 [2022-09-29 15:00:22,684 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 [2022-09-29 15:00:22,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:22,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:22,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:22,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:22,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:22,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:22,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:22,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-09-29 15:00:22,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,726 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) [2022-09-29 15:00:22,728 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 [2022-09-29 15:00:22,728 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 [2022-09-29 15:00:22,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:22,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:22,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:22,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:22,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:22,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:22,758 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:00:22,769 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-09-29 15:00:22,770 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-09-29 15:00:22,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,840 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) [2022-09-29 15:00:22,842 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:00:22,843 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 [2022-09-29 15:00:22,855 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:00:22,856 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:00:22,856 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, readerThread1of1ForFork2_i) = 2*N - 2*readerThread1of1ForFork2_i + 1 Supporting invariants [] [2022-09-29 15:00:22,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-09-29 15:00:22,874 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:00:22,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:22,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:00:22,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:22,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-29 15:00:22,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:00:22,917 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 [2022-09-29 15:00:22,917 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 80 transitions. cyclomatic complexity: 56 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:22,955 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 80 transitions. cyclomatic complexity: 56. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 74 states and 176 transitions. Complement of second has 4 states. [2022-09-29 15:00:22,955 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 [2022-09-29 15:00:22,956 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) [2022-09-29 15:00:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-09-29 15:00:22,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 4 letters. Loop has 1 letters. [2022-09-29 15:00:22,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:22,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 5 letters. Loop has 1 letters. [2022-09-29 15:00:22,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:22,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 4 letters. Loop has 2 letters. [2022-09-29 15:00:22,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:22,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 176 transitions. [2022-09-29 15:00:22,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-09-29 15:00:22,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 51 states and 118 transitions. [2022-09-29 15:00:22,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-09-29 15:00:22,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-09-29 15:00:22,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 118 transitions. [2022-09-29 15:00:22,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-09-29 15:00:22,969 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 118 transitions. [2022-09-29 15:00:22,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 118 transitions. [2022-09-29 15:00:22,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2022-09-29 15:00:22,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.357142857142857) internal successors, (99), 41 states have internal predecessors, (99), 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) [2022-09-29 15:00:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 99 transitions. [2022-09-29 15:00:22,981 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 99 transitions. [2022-09-29 15:00:22,981 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 99 transitions. [2022-09-29 15:00:22,981 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-09-29 15:00:22,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 99 transitions. [2022-09-29 15:00:22,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-09-29 15:00:22,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:22,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:22,990 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-29 15:00:22,990 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:22,991 INFO L733 eck$LassoCheckResult]: Stem: 381#[ULTIMATE.startENTRY]don't care [107] ULTIMATE.startENTRY-->L59: Formula: (and (<= v_ULTIMATE.start_max2_8 v_N_8) (<= 0 v_ULTIMATE.start_min2_8) (<= v_ULTIMATE.start_max1_6 v_N_8) (<= 0 v_ULTIMATE.start_min1_6)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_8, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_8, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} AuxVars[] AssignedVars[] 383#[L59]don't care [95] L59-->writerENTRY: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 389#[L59-1, writerENTRY]don't care [98] L59-1-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] 431#[readerENTRY, L60, writerENTRY]don't care [82] writerENTRY-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 433#[L41-1, readerENTRY, L60]don't care [104] L41-1-->writerEXIT: Formula: (not (< v_writerThread1of1ForFork1_j_19 v_writerThread1of1ForFork1_end_7)) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_19, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_7} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_19, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_7} AuxVars[] AssignedVars[] 395#[readerENTRY, L60, writerEXIT]don't care [99] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork1_thidvar0_4 1) InVars {writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} OutVars{writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] 377#[readerENTRY, L61]don't care [108] readerENTRY-->L28-1: Formula: (and (= v_readerThread1of1ForFork2_i_19 v_readerThread1of1ForFork2_start_5) (= v_readerThread1of1ForFork2_sum_13 0)) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_5} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_13, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_19, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i] 379#[L28-1, L61]don't care [110] L28-1-->readerEXIT: Formula: (not (< v_readerThread1of1ForFork2_i_21 v_readerThread1of1ForFork2_end_9)) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_21, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_9} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_21, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_9} AuxVars[] AssignedVars[] 387#[readerEXIT, L61]don't care [100] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_4 2) (= v_readerThread1of1ForFork2_thidvar0_4 2) (= v_readerThread1of1ForFork2_sum_10 v_ULTIMATE.start_sum_2)) InVars {readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] 417#[L62]don't care [63] L62-->L67: Formula: (and (<= v_ULTIMATE.start_min2_1 v_ULTIMATE.start_max1_1) (<= v_ULTIMATE.start_min1_1 v_ULTIMATE.start_max2_1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} AuxVars[] AssignedVars[] 373#[L67]don't care [92] L67-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_16, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 375#[readerENTRY, L67-1]don't care [112] readerENTRY-->L28-1: Formula: (and (= v_readerThread1of1ForFork0_i_23 v_readerThread1of1ForFork0_start_5) (= v_readerThread1of1ForFork0_sum_17 0)) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5} OutVars{readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_23, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_17} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 391#[L67-1, L28-1]don't care [2022-09-29 15:00:22,991 INFO L735 eck$LassoCheckResult]: Loop: 391#[L67-1, L28-1]don't care [120] L28-1-->L28-1: Formula: (and (= (+ (select v_A_26 v_readerThread1of1ForFork0_i_28) v_readerThread1of1ForFork0_sum_20) v_readerThread1of1ForFork0_sum_19) (<= v_readerThread1of1ForFork0_i_28 v_N_20) (<= 0 v_readerThread1of1ForFork0_i_28) (< v_readerThread1of1ForFork0_i_28 v_readerThread1of1ForFork0_end_11) (= v_readerThread1of1ForFork0_i_27 (+ v_readerThread1of1ForFork0_i_28 1))) InVars {A=v_A_26, N=v_N_20, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_28, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_20, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_11} OutVars{A=v_A_26, N=v_N_20, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_27, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_19, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_11} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 391#[L67-1, L28-1]don't care [2022-09-29 15:00:22,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash -810195599, now seen corresponding path program 1 times [2022-09-29 15:00:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:22,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135244498] [2022-09-29 15:00:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:22,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,011 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:23,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:23,023 INFO L85 PathProgramCache]: Analyzing trace with hash 151, now seen corresponding path program 1 times [2022-09-29 15:00:23,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:23,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971831529] [2022-09-29 15:00:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:23,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,035 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:23,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:23,046 INFO L85 PathProgramCache]: Analyzing trace with hash 653740327, now seen corresponding path program 1 times [2022-09-29 15:00:23,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:23,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925410093] [2022-09-29 15:00:23,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:23,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:00:23,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 15:00:23,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925410093] [2022-09-29 15:00:23,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925410093] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 15:00:23,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 15:00:23,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-29 15:00:23,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662569667] [2022-09-29 15:00:23,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 15:00:23,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 15:00:23,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-29 15:00:23,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-29 15:00:23,197 INFO L87 Difference]: Start difference. First operand 42 states and 99 transitions. cyclomatic complexity: 68 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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) [2022-09-29 15:00:23,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-29 15:00:23,296 INFO L93 Difference]: Finished difference Result 63 states and 139 transitions. [2022-09-29 15:00:23,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 139 transitions. [2022-09-29 15:00:23,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-09-29 15:00:23,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 49 states and 111 transitions. [2022-09-29 15:00:23,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-09-29 15:00:23,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-09-29 15:00:23,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 111 transitions. [2022-09-29 15:00:23,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-09-29 15:00:23,299 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 111 transitions. [2022-09-29 15:00:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 111 transitions. [2022-09-29 15:00:23,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-09-29 15:00:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 42 states have internal predecessors, (96), 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) [2022-09-29 15:00:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 96 transitions. [2022-09-29 15:00:23,301 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 96 transitions. [2022-09-29 15:00:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-29 15:00:23,302 INFO L428 stractBuchiCegarLoop]: Abstraction has 43 states and 96 transitions. [2022-09-29 15:00:23,302 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-09-29 15:00:23,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 96 transitions. [2022-09-29 15:00:23,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-09-29 15:00:23,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:23,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:23,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-29 15:00:23,303 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:23,304 INFO L733 eck$LassoCheckResult]: Stem: 548#[ULTIMATE.startENTRY]don't care [107] ULTIMATE.startENTRY-->L59: Formula: (and (<= v_ULTIMATE.start_max2_8 v_N_8) (<= 0 v_ULTIMATE.start_min2_8) (<= v_ULTIMATE.start_max1_6 v_N_8) (<= 0 v_ULTIMATE.start_min1_6)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_8, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_8, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} AuxVars[] AssignedVars[] 550#[L59]don't care [95] L59-->writerENTRY: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 556#[L59-1, writerENTRY]don't care [98] L59-1-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] 594#[readerENTRY, L60, writerENTRY]don't care [82] writerENTRY-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 596#[L41-1, readerENTRY, L60]don't care [104] L41-1-->writerEXIT: Formula: (not (< v_writerThread1of1ForFork1_j_19 v_writerThread1of1ForFork1_end_7)) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_19, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_7} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_19, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_7} AuxVars[] AssignedVars[] 562#[readerENTRY, L60, writerEXIT]don't care [99] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork1_thidvar0_4 1) InVars {writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} OutVars{writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] 540#[readerENTRY, L61]don't care [108] readerENTRY-->L28-1: Formula: (and (= v_readerThread1of1ForFork2_i_19 v_readerThread1of1ForFork2_start_5) (= v_readerThread1of1ForFork2_sum_13 0)) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_5} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_13, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_19, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i] 542#[L28-1, L61]don't care [119] L28-1-->L28-1: Formula: (and (< v_readerThread1of1ForFork2_i_32 v_readerThread1of1ForFork2_end_11) (= (+ v_readerThread1of1ForFork2_i_32 1) v_readerThread1of1ForFork2_i_31) (<= v_readerThread1of1ForFork2_i_32 v_N_18) (= v_readerThread1of1ForFork2_sum_27 (+ (select v_A_24 v_readerThread1of1ForFork2_i_32) v_readerThread1of1ForFork2_sum_28)) (<= 0 v_readerThread1of1ForFork2_i_32)) InVars {A=v_A_24, N=v_N_18, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_28, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_32, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_11} OutVars{A=v_A_24, N=v_N_18, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_27, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_31, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i] 604#[L28-1, L61]don't care [110] L28-1-->readerEXIT: Formula: (not (< v_readerThread1of1ForFork2_i_21 v_readerThread1of1ForFork2_end_9)) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_21, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_9} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_21, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_9} AuxVars[] AssignedVars[] 554#[readerEXIT, L61]don't care [100] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_4 2) (= v_readerThread1of1ForFork2_thidvar0_4 2) (= v_readerThread1of1ForFork2_sum_10 v_ULTIMATE.start_sum_2)) InVars {readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] 584#[L62]don't care [63] L62-->L67: Formula: (and (<= v_ULTIMATE.start_min2_1 v_ULTIMATE.start_max1_1) (<= v_ULTIMATE.start_min1_1 v_ULTIMATE.start_max2_1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} AuxVars[] AssignedVars[] 544#[L67]don't care [92] L67-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_16, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 546#[readerENTRY, L67-1]don't care [112] readerENTRY-->L28-1: Formula: (and (= v_readerThread1of1ForFork0_i_23 v_readerThread1of1ForFork0_start_5) (= v_readerThread1of1ForFork0_sum_17 0)) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5} OutVars{readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_23, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_17} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 558#[L67-1, L28-1]don't care [2022-09-29 15:00:23,304 INFO L735 eck$LassoCheckResult]: Loop: 558#[L67-1, L28-1]don't care [120] L28-1-->L28-1: Formula: (and (= (+ (select v_A_26 v_readerThread1of1ForFork0_i_28) v_readerThread1of1ForFork0_sum_20) v_readerThread1of1ForFork0_sum_19) (<= v_readerThread1of1ForFork0_i_28 v_N_20) (<= 0 v_readerThread1of1ForFork0_i_28) (< v_readerThread1of1ForFork0_i_28 v_readerThread1of1ForFork0_end_11) (= v_readerThread1of1ForFork0_i_27 (+ v_readerThread1of1ForFork0_i_28 1))) InVars {A=v_A_26, N=v_N_20, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_28, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_20, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_11} OutVars{A=v_A_26, N=v_N_20, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_27, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_19, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_11} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 558#[L67-1, L28-1]don't care [2022-09-29 15:00:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:23,304 INFO L85 PathProgramCache]: Analyzing trace with hash 921711666, now seen corresponding path program 1 times [2022-09-29 15:00:23,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:23,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041199859] [2022-09-29 15:00:23,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:23,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:23,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:23,320 INFO L85 PathProgramCache]: Analyzing trace with hash 151, now seen corresponding path program 2 times [2022-09-29 15:00:23,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:23,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102409690] [2022-09-29 15:00:23,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:23,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,323 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:23,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:23,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1491709306, now seen corresponding path program 1 times [2022-09-29 15:00:23,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:23,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564119098] [2022-09-29 15:00:23,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:23,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,334 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:23,434 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 [2022-09-29 15:00:23,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-09-29 15:00:23,630 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:00:23,630 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:00:23,630 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:00:23,630 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:00:23,630 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:00:23,630 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:23,630 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:00:23,630 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:00:23,630 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration4_Lasso [2022-09-29 15:00:23,630 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:00:23,630 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:00:23,634 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:23,637 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:23,639 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:23,719 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:23,721 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:23,723 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:23,868 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:00:23,869 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:00:23,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:23,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:23,870 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) [2022-09-29 15:00:23,872 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 [2022-09-29 15:00:23,873 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 [2022-09-29 15:00:23,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:23,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:23,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:23,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:23,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:23,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:23,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:23,916 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 [2022-09-29 15:00:23,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:23,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:23,918 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) [2022-09-29 15:00:23,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-09-29 15:00:23,964 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 [2022-09-29 15:00:23,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:23,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:23,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:23,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:23,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:23,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:23,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:23,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-09-29 15:00:23,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:23,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:23,995 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) [2022-09-29 15:00:23,995 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 [2022-09-29 15:00:23,997 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 [2022-09-29 15:00:24,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:24,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:24,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:24,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:24,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:24,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:24,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:24,048 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 [2022-09-29 15:00:24,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:24,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:24,049 INFO L229 MonitoredProcess]: Starting monitored process 14 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) [2022-09-29 15:00:24,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-09-29 15:00:24,051 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 [2022-09-29 15:00:24,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:24,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:24,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:24,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:24,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:24,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:24,083 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:00:24,123 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-09-29 15:00:24,123 INFO L444 ModelExtractionUtils]: 12 out of 46 variables were initially zero. Simplification set additionally 31 variables to zero. [2022-09-29 15:00:24,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:24,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:24,124 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) [2022-09-29 15:00:24,125 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 [2022-09-29 15:00:24,126 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:00:24,132 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:00:24,132 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:00:24,132 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork0_i, readerThread1of1ForFork0_end) = -1*readerThread1of1ForFork0_i + 1*readerThread1of1ForFork0_end Supporting invariants [] [2022-09-29 15:00:24,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-09-29 15:00:24,149 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:00:24,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:24,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:00:24,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:24,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-29 15:00:24,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:00:24,197 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 [2022-09-29 15:00:24,197 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 96 transitions. cyclomatic complexity: 64 Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2022-09-29 15:00:24,211 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 96 transitions. cyclomatic complexity: 64. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 44 states and 97 transitions. Complement of second has 2 states. [2022-09-29 15:00:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-09-29 15:00:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2022-09-29 15:00:24,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 15 transitions. [2022-09-29 15:00:24,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 13 letters. Loop has 1 letters. [2022-09-29 15:00:24,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:24,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 14 letters. Loop has 1 letters. [2022-09-29 15:00:24,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:24,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 13 letters. Loop has 2 letters. [2022-09-29 15:00:24,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:24,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 97 transitions. [2022-09-29 15:00:24,214 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-09-29 15:00:24,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2022-09-29 15:00:24,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-09-29 15:00:24,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-09-29 15:00:24,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-09-29 15:00:24,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-29 15:00:24,215 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-09-29 15:00:24,215 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-09-29 15:00:24,215 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-09-29 15:00:24,215 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-09-29 15:00:24,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-09-29 15:00:24,215 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-09-29 15:00:24,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-09-29 15:00:24,220 INFO L202 PluginConnector]: Adding new model optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.09 03:00:24 BoogieIcfgContainer [2022-09-29 15:00:24,220 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-09-29 15:00:24,221 INFO L158 Benchmark]: Toolchain (without parser) took 3693.43ms. Allocated memory was 195.0MB in the beginning and 268.4MB in the end (delta: 73.4MB). Free memory was 151.0MB in the beginning and 179.8MB in the end (delta: -28.9MB). Peak memory consumption was 44.5MB. Max. memory is 8.0GB. [2022-09-29 15:00:24,221 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 195.0MB. Free memory is still 152.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 15:00:24,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.60ms. Allocated memory is still 195.0MB. Free memory was 151.0MB in the beginning and 149.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 15:00:24,222 INFO L158 Benchmark]: Boogie Preprocessor took 17.31ms. Allocated memory is still 195.0MB. Free memory was 149.4MB in the beginning and 148.5MB in the end (delta: 869.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 15:00:24,222 INFO L158 Benchmark]: RCFGBuilder took 201.75ms. Allocated memory is still 195.0MB. Free memory was 148.4MB in the beginning and 139.4MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-09-29 15:00:24,222 INFO L158 Benchmark]: BuchiAutomizer took 3445.51ms. Allocated memory was 195.0MB in the beginning and 268.4MB in the end (delta: 73.4MB). Free memory was 139.3MB in the beginning and 179.8MB in the end (delta: -40.6MB). Peak memory consumption was 33.0MB. Max. memory is 8.0GB. [2022-09-29 15:00:24,223 INFO L339 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.14ms. Allocated memory is still 195.0MB. Free memory is still 152.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.60ms. Allocated memory is still 195.0MB. Free memory was 151.0MB in the beginning and 149.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.31ms. Allocated memory is still 195.0MB. Free memory was 149.4MB in the beginning and 148.5MB in the end (delta: 869.5kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 201.75ms. Allocated memory is still 195.0MB. Free memory was 148.4MB in the beginning and 139.4MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 3445.51ms. Allocated memory was 195.0MB in the beginning and 268.4MB in the end (delta: 73.4MB). Free memory was 139.3MB in the beginning and 179.8MB in the end (delta: -40.6MB). Peak memory consumption was 33.0MB. 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 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function end + -1 * j and consists of 3 locations. One deterministic module has affine ranking function 2 * N + -2 * i + 1 and consists of 3 locations. One deterministic module has affine ranking function end + -1 * i and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 12 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital71 mio100 ax100 hnf100 lsp82 ukn92 mio100 lsp87 div100 bol100 ite100 ukn100 eq158 hnf91 smp100 dnf100 smp100 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 149ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 41 PlacesBefore, 26 PlacesAfterwards, 35 TransitionsBefore, 20 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 130 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 119, positive conditional: 0, positive unconditional: 119, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 91, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 91, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 91, unknown conditional: 0, unknown unconditional: 91] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2022-09-29 15:00:24,260 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 [2022-09-29 15:00:24,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...