/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-buchi-pn-semanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.fs.omega-petrinet-638c691-m [2022-09-29 15:02:51,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 15:02:51,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 15:02:51,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 15:02:51,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 15:02:51,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 15:02:51,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 15:02:51,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 15:02:51,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 15:02:51,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 15:02:51,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 15:02:51,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 15:02:51,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 15:02:51,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 15:02:51,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 15:02:51,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 15:02:51,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 15:02:51,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 15:02:51,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 15:02:51,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 15:02:51,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 15:02:51,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 15:02:51,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 15:02:51,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 15:02:51,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 15:02:51,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 15:02:51,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 15:02:51,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 15:02:51,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 15:02:51,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 15:02:51,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 15:02:51,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 15:02:51,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 15:02:51,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 15:02:51,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 15:02:51,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 15:02:51,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 15:02:51,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 15:02:51,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 15:02:51,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 15:02:51,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 15:02:51,715 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-buchi-pn-semanticLbe.epf [2022-09-29 15:02:51,746 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 15:02:51,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 15:02:51,746 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 15:02:51,747 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 15:02:51,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 15:02:51,748 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 15:02:51,748 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 15:02:51,748 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-09-29 15:02:51,748 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-09-29 15:02:51,748 INFO L138 SettingsManager]: * Use old map elimination=false [2022-09-29 15:02:51,749 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-09-29 15:02:51,749 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-09-29 15:02:51,749 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-09-29 15:02:51,750 INFO L138 SettingsManager]: * Automaton type for concurrent programs=BUCHI_PETRI_NET [2022-09-29 15:02:51,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 15:02:51,750 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 15:02:51,750 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-09-29 15:02:51,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 15:02:51,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 15:02:51,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 15:02:51,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-09-29 15:02:51,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-09-29 15:02:51,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-09-29 15:02:51,752 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 15:02:51,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 15:02:51,752 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-09-29 15:02:51,752 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 15:02:51,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-09-29 15:02:51,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 15:02:51,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 15:02:51,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 15:02:51,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 15:02:51,754 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-09-29 15:02:51,754 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:02:51,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 15:02:52,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 15:02:52,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 15:02:52,004 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 15:02:52,005 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 15:02:52,006 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update3.bpl [2022-09-29 15:02:52,006 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update3.bpl' [2022-09-29 15:02:52,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 15:02:52,035 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-09-29 15:02:52,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-29 15:02:52,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-29 15:02:52,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-29 15:02:52,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:52" (1/1) ... [2022-09-29 15:02:52,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:52" (1/1) ... [2022-09-29 15:02:52,058 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-09-29 15:02:52,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-29 15:02:52,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 15:02:52,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 15:02:52,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 15:02:52,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:52" (1/1) ... [2022-09-29 15:02:52,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:52" (1/1) ... [2022-09-29 15:02:52,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:52" (1/1) ... [2022-09-29 15:02:52,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:52" (1/1) ... [2022-09-29 15:02:52,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:52" (1/1) ... [2022-09-29 15:02:52,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:52" (1/1) ... [2022-09-29 15:02:52,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:52" (1/1) ... [2022-09-29 15:02:52,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 15:02:52,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 15:02:52,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 15:02:52,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 15:02:52,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:52" (1/1) ... [2022-09-29 15:02:52,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:52,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:02:52,105 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:02:52,111 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:02:52,140 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-09-29 15:02:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-29 15:02:52,140 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-29 15:02:52,141 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-09-29 15:02:52,141 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-29 15:02:52,141 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-29 15:02:52,141 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-09-29 15:02:52,141 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-29 15:02:52,142 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-29 15:02:52,142 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-09-29 15:02:52,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 15:02:52,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 15:02:52,144 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:02:52,179 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 15:02:52,181 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 15:02:52,291 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 15:02:52,297 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 15:02:52,298 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-29 15:02:52,300 INFO L202 PluginConnector]: Adding new model map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:02:52 BoogieIcfgContainer [2022-09-29 15:02:52,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 15:02:52,308 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-09-29 15:02:52,308 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-09-29 15:02:52,326 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-09-29 15:02:52,327 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:02:52,327 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:02:52" (1/2) ... [2022-09-29 15:02:52,328 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c9cd9dd and model type map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.09 03:02:52, skipping insertion in model container [2022-09-29 15:02:52,328 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:02:52,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:02:52" (2/2) ... [2022-09-29 15:02:52,329 INFO L322 chiAutomizerObserver]: Analyzing ICFG map-aggr-update3.bpl [2022-09-29 15:02:52,436 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-09-29 15:02:52,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 104 flow [2022-09-29 15:02:52,487 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:02:52,487 INFO L123 PetriNetUnfolderBase]: 5/34 cut-off events. [2022-09-29 15:02:52,487 INFO L124 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2022-09-29 15:02:52,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 5/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 72 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2022-09-29 15:02:52,494 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 40 transitions, 104 flow [2022-09-29 15:02:52,505 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 86 flow [2022-09-29 15:02:52,508 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 15:02:52,535 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 86 flow [2022-09-29 15:02:52,541 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 86 flow [2022-09-29 15:02:52,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 86 flow [2022-09-29 15:02:52,567 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:02:52,567 INFO L123 PetriNetUnfolderBase]: 5/34 cut-off events. [2022-09-29 15:02:52,567 INFO L124 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2022-09-29 15:02:52,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 5/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2022-09-29 15:02:52,569 INFO L116 LiptonReduction]: Number of co-enabled transitions 456 [2022-09-29 15:02:53,158 INFO L131 LiptonReduction]: Checked pairs total: 380 [2022-09-29 15:02:53,158 INFO L133 LiptonReduction]: Total number of compositions: 18 [2022-09-29 15:02:53,172 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 15:02:53,173 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 15:02:53,173 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 15:02:53,173 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 15:02:53,173 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 15:02:53,173 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 15:02:53,173 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 15:02:53,173 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2022-09-29 15:02:53,174 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 25 places, 18 transitions, 54 flow [2022-09-29 15:02:53,178 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 25 places, 18 transitions, 54 flow [2022-09-29 15:02:53,180 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:53,180 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 15:02:53,180 INFO L123 PetriNetUnfolderBase]: 0/3 cut-off events. [2022-09-29 15:02:53,181 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 15:02:53,181 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 15:02:53,184 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 15:02:53,184 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 25 places, 18 transitions, 54 flow [2022-09-29 15:02:53,186 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 25 places, 18 transitions, 54 flow [2022-09-29 15:02:53,186 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:53,186 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 15:02:53,186 INFO L123 PetriNetUnfolderBase]: 0/3 cut-off events. [2022-09-29 15:02:53,187 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 15:02:53,187 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 15:02:53,192 INFO L733 eck$LassoCheckResult]: Stem: 46#[ULTIMATE.startENTRY]true [74] ULTIMATE.startENTRY-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 48#[L34]true [114] L34-->thread1ENTRY: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[L34-1, thread1ENTRY]true [88] thread1ENTRY-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 52#[L51-1, L34-1]true [2022-09-29 15:02:53,192 INFO L735 eck$LassoCheckResult]: Loop: 52#[L51-1, L34-1]true [138] L51-1-->L51-1: Formula: (and (< v_thread1Thread1of1ForFork0_i_28 v_N_26) (= (+ v_thread1Thread1of1ForFork0_i_28 1) v_thread1Thread1of1ForFork0_i_27) (= v_A_31 (store v_A_32 v_thread1Thread1of1ForFork0_i_28 (let ((.cse0 (select v_A_32 v_thread1Thread1of1ForFork0_i_28))) (ite (< .cse0 0) (- .cse0) .cse0))))) InVars {A=v_A_32, N=v_N_26, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_28} OutVars{A=v_A_31, N=v_N_26, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_27} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork0_i] 52#[L51-1, L34-1]true [2022-09-29 15:02:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:53,197 INFO L85 PathProgramCache]: Analyzing trace with hash 104527, now seen corresponding path program 1 times [2022-09-29 15:02:53,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:02:53,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779746128] [2022-09-29 15:02:53,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:02:53,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:02:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:53,280 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:02:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:53,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:02:53,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:53,305 INFO L85 PathProgramCache]: Analyzing trace with hash 169, now seen corresponding path program 1 times [2022-09-29 15:02:53,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:02:53,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571926229] [2022-09-29 15:02:53,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:02:53,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:02:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:53,325 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:02:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:53,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:02:53,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:53,339 INFO L85 PathProgramCache]: Analyzing trace with hash 3240475, now seen corresponding path program 1 times [2022-09-29 15:02:53,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:02:53,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387825371] [2022-09-29 15:02:53,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:02:53,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:02:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:53,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:02:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:53,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:02:53,508 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:02:53,508 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:02:53,508 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:02:53,509 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:02:53,509 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:02:53,509 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:53,509 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:02:53,509 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:02:53,509 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update3.bpl_BEv2_Iteration1_Lasso [2022-09-29 15:02:53,509 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:02:53,509 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:02:53,548 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:02:53,573 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:02:53,612 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:02:53,616 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:02:53,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:53,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:02:53,624 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:02:53,626 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:02:53,627 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:02:53,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:02:53,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-09-29 15:02:53,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:02:53,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:02:53,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:02:53,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-09-29 15:02:53,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-09-29 15:02:53,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:02:53,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-09-29 15:02:53,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:53,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:02:53,676 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:02:53,687 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:02:53,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:02:53,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:02:53,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:02:53,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:02:53,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:02:53,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:02:53,687 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:02:53,708 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:02:53,729 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-09-29 15:02:53,729 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-09-29 15:02:53,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:53,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:02:53,733 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:02:53,735 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:02:53,744 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:02:53,756 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:02:53,757 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:02:53,757 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2022-09-29 15:02:53,783 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:02:53,786 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:02:53,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:02:53,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:02:53,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:02:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:02:53,830 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-29 15:02:53,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:02:53,830 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:02:53,859 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:02:53,861 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. 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:02:54,040 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. 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 6 states and 511 transitions.4 powerset states2 rank states. The highest rank that occured is 1 [2022-09-29 15:02:54,041 INFO L54 IntersectBuchiEager]: Starting Intersection [2022-09-29 15:02:54,044 INFO L61 IntersectBuchiEager]: Exiting Intersection [2022-09-29 15:02:54,046 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:02:54,050 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:02:54,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-09-29 15:02:54,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 3 letters. Loop has 1 letters. [2022-09-29 15:02:54,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:02:54,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 4 letters. Loop has 1 letters. [2022-09-29 15:02:54,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:02:54,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 3 letters. Loop has 2 letters. [2022-09-29 15:02:54,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:02:54,055 INFO L428 stractBuchiCegarLoop]: Abstraction has has 37 places, 302 transitions, 1514 flow [2022-09-29 15:02:54,055 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-09-29 15:02:54,056 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 37 places, 302 transitions, 1514 flow [2022-09-29 15:02:54,057 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 37 places, 302 transitions, 1514 flow [2022-09-29 15:02:54,059 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:54,066 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 37 places, 302 transitions, 1514 flow [2022-09-29 15:02:54,071 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:54,071 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 15:02:54,071 INFO L123 PetriNetUnfolderBase]: 5/15 cut-off events. [2022-09-29 15:02:54,071 INFO L124 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2022-09-29 15:02:54,071 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 15:02:54,072 INFO L733 eck$LassoCheckResult]: Stem: 46#[ULTIMATE.startENTRY]true [74] ULTIMATE.startENTRY-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 48#[L34]true [114] L34-->thread1ENTRY: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[L34-1, thread1ENTRY]true [117] L34-1-->thread2ENTRY: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 103#[thread2ENTRY, thread1ENTRY, L35]true [132] thread2ENTRY-->L65-1: Formula: (and (= (- 1) v_thread2Thread1of1ForFork1_cnt_23) (= v_thread2Thread1of1ForFork1_j_41 0)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_41, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt] 105#[L65-1, thread1ENTRY, L35]true [2022-09-29 15:02:54,072 INFO L735 eck$LassoCheckResult]: Loop: 105#[L65-1, thread1ENTRY, L35]true [141] L65-1-->L65-1: Formula: (and (let ((.cse0 (< v_thread2Thread1of1ForFork1_j_58 v_N_30)) (.cse1 (= (select v_A_39 v_thread2Thread1of1ForFork1_j_58) 0))) (or (and (= v_thread2Thread1of1ForFork1_cnt_47 v_thread2Thread1of1ForFork1_cnt_46) .cse0 (not .cse1)) (and .cse0 .cse1 (= (+ v_thread2Thread1of1ForFork1_cnt_47 1) v_thread2Thread1of1ForFork1_cnt_46)))) (let ((.cse2 (= v_thread2Thread1of1ForFork1_j_57 (+ v_thread2Thread1of1ForFork1_j_58 1))) (.cse3 (< 0 (select v_B_35 v_thread2Thread1of1ForFork1_j_58)))) (or (and .cse2 .cse3 (= (+ v_thread2Thread1of1ForFork1_cnt_46 1) v_thread2Thread1of1ForFork1_cnt_45)) (and .cse2 (not .cse3) (= v_thread2Thread1of1ForFork1_cnt_46 v_thread2Thread1of1ForFork1_cnt_45))))) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_58, A=v_A_39, N=v_N_30, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_47, B=v_B_35} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_57, A=v_A_39, N=v_N_30, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_45, B=v_B_35} AuxVars[v_thread2Thread1of1ForFork1_cnt_46] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt] 105#[L65-1, thread1ENTRY, L35]true [2022-09-29 15:02:54,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:54,073 INFO L85 PathProgramCache]: Analyzing trace with hash 3241368, now seen corresponding path program 1 times [2022-09-29 15:02:54,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:02:54,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147258417] [2022-09-29 15:02:54,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:02:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:02:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:54,078 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:02:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:54,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:02:54,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:54,083 INFO L85 PathProgramCache]: Analyzing trace with hash 172, now seen corresponding path program 1 times [2022-09-29 15:02:54,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:02:54,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968721560] [2022-09-29 15:02:54,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:02:54,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:02:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:54,090 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:02:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:54,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:02:54,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash 100482549, now seen corresponding path program 1 times [2022-09-29 15:02:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:02:54,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783334762] [2022-09-29 15:02:54,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:02:54,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:02:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:54,106 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:02:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:54,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:02:54,274 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:02:54,275 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:02:54,275 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:02:54,275 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:02:54,275 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:02:54,275 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:54,275 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:02:54,275 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:02:54,275 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update3.bpl_BEv2_Iteration2_Lasso [2022-09-29 15:02:54,275 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:02:54,275 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:02:54,281 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:02:54,284 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:02:54,286 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:02:54,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:02:54,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:02:54,576 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:02:54,577 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:02:54,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:54,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:02:54,578 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:02:54,580 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:02:54,581 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:02:54,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:02:54,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:02:54,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:02:54,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:02:54,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:02:54,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:02:54,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:02:54,635 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:02:54,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:54,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:02:54,637 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:02:54,638 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:02:54,640 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:02:54,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:02:54,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-09-29 15:02:54,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:02:54,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:02:54,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:02:54,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-09-29 15:02:54,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-09-29 15:02:54,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:02:54,689 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:02:54,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:54,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:02:54,691 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:02:54,698 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:02:54,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:02:54,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:02:54,705 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2022-09-29 15:02:54,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:02:54,711 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:02:54,785 INFO L401 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2022-09-29 15:02:54,786 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2022-09-29 15:02:54,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:02:54,883 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:02:54,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:54,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:02:54,885 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:02:54,886 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:02:54,887 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:02:54,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:02:54,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:02:54,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:02:54,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:02:54,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:02:54,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:02:54,923 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:02:54,934 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-09-29 15:02:54,934 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-09-29 15:02:54,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:02:54,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:02:54,969 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:02:54,970 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:02:54,971 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:02:54,988 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:02:54,989 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:02:54,989 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2022-09-29 15:02:55,015 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:02:55,016 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:02:55,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:02:55,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:02:55,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:02:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:02:55,052 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-29 15:02:55,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:02:55,053 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:02:55,053 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:02:55,054 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. 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:02:55,174 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. 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 6 states and 508 transitions.4 powerset states2 rank states. The highest rank that occured is 1 [2022-09-29 15:02:55,174 INFO L54 IntersectBuchiEager]: Starting Intersection [2022-09-29 15:02:55,211 INFO L61 IntersectBuchiEager]: Exiting Intersection [2022-09-29 15:02:55,211 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:02:55,212 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:02:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2022-09-29 15:02:55,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 168 transitions. Stem has 4 letters. Loop has 1 letters. [2022-09-29 15:02:55,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:02:55,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 168 transitions. Stem has 5 letters. Loop has 1 letters. [2022-09-29 15:02:55,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:02:55,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 168 transitions. Stem has 4 letters. Loop has 2 letters. [2022-09-29 15:02:55,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:02:55,215 INFO L428 stractBuchiCegarLoop]: Abstraction has has 49 places, 5040 transitions, 35424 flow [2022-09-29 15:02:55,215 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-09-29 15:02:55,215 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 49 places, 5040 transitions, 35424 flow [2022-09-29 15:02:55,237 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 49 places, 5040 transitions, 35424 flow [2022-09-29 15:02:55,245 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:55,248 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 49 places, 5040 transitions, 35424 flow [2022-09-29 15:02:55,257 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:55,334 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 49 places, 5040 transitions, 35424 flow [2022-09-29 15:02:55,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-09-29 15:02:55,369 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:55,375 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 49 places, 5040 transitions, 35424 flow [2022-09-29 15:02:55,397 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:02:55,398 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:55,404 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 49 places, 5040 transitions, 35424 flow [2022-09-29 15:02:55,418 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:55,428 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 49 places, 5040 transitions, 35424 flow [2022-09-29 15:02:55,438 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:55,462 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 49 places, 5040 transitions, 35424 flow [2022-09-29 15:02:55,476 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:55,477 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 49 places, 5040 transitions, 35424 flow [2022-09-29 15:02:55,491 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:55,494 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 49 places, 5040 transitions, 35424 flow [2022-09-29 15:02:55,507 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:55,508 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 49 places, 5040 transitions, 35424 flow [2022-09-29 15:02:55,536 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 15:02:55,536 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 15:02:55,537 INFO L123 PetriNetUnfolderBase]: 164/242 cut-off events. [2022-09-29 15:02:55,537 INFO L124 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2022-09-29 15:02:55,537 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 15:02:55,538 INFO L733 eck$LassoCheckResult]: Stem: 46#[ULTIMATE.startENTRY]true [74] ULTIMATE.startENTRY-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 48#[L34]true [114] L34-->thread1ENTRY: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[L34-1, thread1ENTRY]true [117] L34-1-->thread2ENTRY: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 103#[thread2ENTRY, thread1ENTRY, L35]true [120] L35-->thread3ENTRY: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_12} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k] 154#[L36, thread2ENTRY, thread1ENTRY, thread3ENTRY]true [106] thread3ENTRY-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 156#[L83-1, L36, thread2ENTRY, thread1ENTRY]true [2022-09-29 15:02:55,538 INFO L735 eck$LassoCheckResult]: Loop: 156#[L83-1, L36, thread2ENTRY, thread1ENTRY]true [136] L83-1-->L83-1: Formula: (and (= v_thread3Thread1of1ForFork2_k_25 0) (= v_B_31 (store v_B_32 v_thread3Thread1of1ForFork2_k_26 v_thread3Thread1of1ForFork2_k_26)) (< v_thread3Thread1of1ForFork2_k_26 v_N_22)) InVars {N=v_N_22, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_26, B=v_B_32} OutVars{N=v_N_22, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_25, B=v_B_31} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k, B] 156#[L83-1, L36, thread2ENTRY, thread1ENTRY]true [2022-09-29 15:02:55,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:55,539 INFO L85 PathProgramCache]: Analyzing trace with hash 100482142, now seen corresponding path program 1 times [2022-09-29 15:02:55,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:02:55,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982919898] [2022-09-29 15:02:55,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:02:55,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:02:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:55,554 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:02:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:55,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:02:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:55,573 INFO L85 PathProgramCache]: Analyzing trace with hash 167, now seen corresponding path program 1 times [2022-09-29 15:02:55,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:02:55,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206546200] [2022-09-29 15:02:55,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:02:55,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:02:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:55,580 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:02:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:55,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:02:55,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:02:55,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1180020758, now seen corresponding path program 1 times [2022-09-29 15:02:55,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:02:55,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249440005] [2022-09-29 15:02:55,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:02:55,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:02:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:55,589 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:02:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:02:55,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:02:55,691 INFO L202 PluginConnector]: Adding new model map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.09 03:02:55 BoogieIcfgContainer [2022-09-29 15:02:55,691 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-09-29 15:02:55,692 INFO L158 Benchmark]: Toolchain (without parser) took 3657.13ms. Allocated memory was 190.8MB in the beginning and 312.5MB in the end (delta: 121.6MB). Free memory was 143.2MB in the beginning and 243.5MB in the end (delta: -100.4MB). Peak memory consumption was 22.3MB. Max. memory is 8.0GB. [2022-09-29 15:02:55,693 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 15:02:55,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.99ms. Allocated memory is still 190.8MB. Free memory was 143.1MB in the beginning and 141.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 15:02:55,694 INFO L158 Benchmark]: Boogie Preprocessor took 15.09ms. Allocated memory is still 190.8MB. Free memory was 141.5MB in the beginning and 140.5MB in the end (delta: 992.1kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 15:02:55,694 INFO L158 Benchmark]: RCFGBuilder took 231.03ms. Allocated memory is still 190.8MB. Free memory was 140.5MB in the beginning and 131.3MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-09-29 15:02:55,695 INFO L158 Benchmark]: BuchiAutomizer took 3383.16ms. Allocated memory was 190.8MB in the beginning and 312.5MB in the end (delta: 121.6MB). Free memory was 131.2MB in the beginning and 243.5MB in the end (delta: -112.3MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-09-29 15:02:55,697 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.09ms. Allocated memory is still 190.8MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.99ms. Allocated memory is still 190.8MB. Free memory was 143.1MB in the beginning and 141.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.09ms. Allocated memory is still 190.8MB. Free memory was 141.5MB in the beginning and 140.5MB in the end (delta: 992.1kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 231.03ms. Allocated memory is still 190.8MB. Free memory was 140.5MB in the beginning and 131.3MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3383.16ms. Allocated memory was 190.8MB in the beginning and 312.5MB in the end (delta: 121.6MB). Free memory was 131.2MB in the beginning and 243.5MB in the end (delta: -112.3MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. One deterministic module has affine ranking function N + -1 * j and consists of 3 locations. The remainder module has 35424 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 160 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 115 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital80 mio100 ax100 hnf100 lsp157 ukn31 mio100 lsp87 div100 bol100 ite100 ukn100 eq165 hnf96 smp100 dnf183 smp72 tf100 neg96 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 176ms VariablesStem: 1 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.7s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 83]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {m=0, N=1} State at position 1 is {cnt=0, i=0, j=0, k=0, m=0, N=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 83]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L32] 0 assume 0 <= m && m < N; [L34] FORK 0 fork 1 thread1(); [L35] FORK 0 fork 2, 2 thread2(); [L36] FORK 0 fork 3, 3, 3 thread3(); [L82] 3 k := 0; Loop: [L83] COND TRUE k < N [L84] B[k] := k; [L85] k := 0; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 39 PlacesBefore, 25 PlacesAfterwards, 34 TransitionsBefore, 18 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 14 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 2 ChoiceCompositions, 18 TotalNumberOfCompositions, 380 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 359, positive: 355, positive conditional: 0, positive unconditional: 355, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 257, positive: 253, positive conditional: 0, positive unconditional: 253, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 257, positive: 249, positive conditional: 0, positive unconditional: 249, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 359, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 257, unknown conditional: 0, unknown unconditional: 257] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2022-09-29 15:02:55,775 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...