/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/equal-array-sums.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.fs.omega-petrinet-ed1a3e5-m [2022-09-29 14:45:27,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 14:45:27,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 14:45:27,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 14:45:27,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 14:45:27,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 14:45:27,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 14:45:27,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 14:45:27,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 14:45:27,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 14:45:27,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 14:45:27,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 14:45:27,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 14:45:27,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 14:45:27,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 14:45:27,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 14:45:27,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 14:45:27,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 14:45:27,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 14:45:27,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 14:45:27,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 14:45:27,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 14:45:27,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 14:45:27,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 14:45:27,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 14:45:27,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 14:45:27,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 14:45:27,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 14:45:27,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 14:45:27,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 14:45:27,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 14:45:27,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 14:45:27,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 14:45:27,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 14:45:27,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 14:45:27,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 14:45:27,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 14:45:27,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 14:45:27,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 14:45:27,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 14:45:27,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 14:45:27,258 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 14:45:27,281 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 14:45:27,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 14:45:27,282 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 14:45:27,282 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 14:45:27,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 14:45:27,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 14:45:27,283 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 14:45:27,283 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-09-29 14:45:27,283 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-09-29 14:45:27,283 INFO L138 SettingsManager]: * Use old map elimination=false [2022-09-29 14:45:27,284 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-09-29 14:45:27,284 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-09-29 14:45:27,284 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-09-29 14:45:27,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 14:45:27,284 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 14:45:27,284 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-09-29 14:45:27,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 14:45:27,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 14:45:27,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 14:45:27,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-09-29 14:45:27,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-09-29 14:45:27,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-09-29 14:45:27,285 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 14:45:27,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 14:45:27,285 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-09-29 14:45:27,285 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 14:45:27,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-09-29 14:45:27,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 14:45:27,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 14:45:27,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 14:45:27,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 14:45:27,286 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-09-29 14:45:27,287 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 14:45:27,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 14:45:27,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 14:45:27,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 14:45:27,484 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 14:45:27,485 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 14:45:27,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/equal-array-sums.bpl [2022-09-29 14:45:27,486 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/equal-array-sums.bpl' [2022-09-29 14:45:27,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 14:45:27,502 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-09-29 14:45:27,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-29 14:45:27,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-29 14:45:27,503 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-29 14:45:27,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:27" (1/1) ... [2022-09-29 14:45:27,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:27" (1/1) ... [2022-09-29 14:45:27,522 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-09-29 14:45:27,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-29 14:45:27,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 14:45:27,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 14:45:27,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 14:45:27,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:27" (1/1) ... [2022-09-29 14:45:27,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:27" (1/1) ... [2022-09-29 14:45:27,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:27" (1/1) ... [2022-09-29 14:45:27,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:27" (1/1) ... [2022-09-29 14:45:27,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:27" (1/1) ... [2022-09-29 14:45:27,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:27" (1/1) ... [2022-09-29 14:45:27,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:27" (1/1) ... [2022-09-29 14:45:27,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 14:45:27,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 14:45:27,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 14:45:27,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 14:45:27,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:27" (1/1) ... [2022-09-29 14:45:27,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 14:45:27,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 14:45:27,569 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 14:45:27,583 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 14:45:27,608 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-09-29 14:45:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-29 14:45:27,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-29 14:45:27,609 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-09-29 14:45:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-29 14:45:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-29 14:45:27,609 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-09-29 14:45:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 14:45:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 14:45:27,610 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 14:45:27,640 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 14:45:27,641 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 14:45:27,737 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 14:45:27,741 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 14:45:27,742 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-29 14:45:27,743 INFO L202 PluginConnector]: Adding new model equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 02:45:27 BoogieIcfgContainer [2022-09-29 14:45:27,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 14:45:27,743 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-09-29 14:45:27,743 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-09-29 14:45:27,746 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-09-29 14:45:27,746 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 14:45:27,746 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:27" (1/2) ... [2022-09-29 14:45:27,747 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e8a4878 and model type equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.09 02:45:27, skipping insertion in model container [2022-09-29 14:45:27,747 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 14:45:27,747 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 02:45:27" (2/2) ... [2022-09-29 14:45:27,748 INFO L322 chiAutomizerObserver]: Analyzing ICFG equal-array-sums.bpl [2022-09-29 14:45:27,779 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-29 14:45:27,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 66 flow [2022-09-29 14:45:27,844 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:45:27,844 INFO L123 PetriNetUnfolderBase]: 2/21 cut-off events. [2022-09-29 14:45:27,844 INFO L124 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2022-09-29 14:45:27,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2022-09-29 14:45:27,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 66 flow [2022-09-29 14:45:27,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2022-09-29 14:45:27,867 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 14:45:27,888 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 54 flow [2022-09-29 14:45:27,891 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 21 transitions, 54 flow [2022-09-29 14:45:27,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 54 flow [2022-09-29 14:45:27,899 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:45:27,899 INFO L123 PetriNetUnfolderBase]: 2/21 cut-off events. [2022-09-29 14:45:27,899 INFO L124 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2022-09-29 14:45:27,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2022-09-29 14:45:27,900 INFO L116 LiptonReduction]: Number of co-enabled transitions 96 [2022-09-29 14:45:28,070 INFO L131 LiptonReduction]: Checked pairs total: 63 [2022-09-29 14:45:28,071 INFO L133 LiptonReduction]: Total number of compositions: 8 [2022-09-29 14:45:28,090 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 14:45:28,090 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 14:45:28,090 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 14:45:28,091 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 14:45:28,091 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 14:45:28,091 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 14:45:28,091 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 14:45:28,091 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-09-29 14:45:28,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-09-29 14:45:28,120 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2022-09-29 14:45:28,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:45:28,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:45:28,124 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-09-29 14:45:28,124 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 14:45:28,124 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 14:45:28,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 19 states, but on-demand construction may add more states [2022-09-29 14:45:28,128 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2022-09-29 14:45:28,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:45:28,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:45:28,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-09-29 14:45:28,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 14:45:28,133 INFO L733 eck$LassoCheckResult]: Stem: 31#[ULTIMATE.startENTRY]don't care [71] ULTIMATE.startENTRY-->L21: Formula: (and (= v_y_10 0) (= v_x_6 0)) InVars {} OutVars{y=v_y_10, x=v_x_6} AuxVars[] AssignedVars[y, x] 34#[L21]don't care [64] L21-->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] 36#[thread1ENTRY, L21-1]don't care [50] thread1ENTRY-->L35-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 38#[L35-1, L21-1]don't care [2022-09-29 14:45:28,133 INFO L735 eck$LassoCheckResult]: Loop: 38#[L35-1, L21-1]don't care [77] L35-1-->L35-1: Formula: (and (< v_thread1Thread1of1ForFork0_i_20 v_n_15) (= v_thread1Thread1of1ForFork0_i_19 (+ v_thread1Thread1of1ForFork0_i_20 1)) (= (+ v_x_15 (select v_A_9 v_thread1Thread1of1ForFork0_i_20)) v_x_14)) InVars {A=v_A_9, n=v_n_15, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_20, x=v_x_15} OutVars{A=v_A_9, n=v_n_15, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_19, x=v_x_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i, x] 38#[L35-1, L21-1]don't care [2022-09-29 14:45:28,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:28,138 INFO L85 PathProgramCache]: Analyzing trace with hash 100056, now seen corresponding path program 1 times [2022-09-29 14:45:28,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:45:28,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55182215] [2022-09-29 14:45:28,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:45:28,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:45:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:28,200 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:45:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:28,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:45:28,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:28,223 INFO L85 PathProgramCache]: Analyzing trace with hash 108, now seen corresponding path program 1 times [2022-09-29 14:45:28,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:45:28,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090124404] [2022-09-29 14:45:28,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:45:28,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:45:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:28,240 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:45:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:28,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:45:28,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:28,250 INFO L85 PathProgramCache]: Analyzing trace with hash 3101813, now seen corresponding path program 1 times [2022-09-29 14:45:28,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:45:28,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218509562] [2022-09-29 14:45:28,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:45:28,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:45:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:28,261 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:45:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:28,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:45:28,346 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 14:45:28,347 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 14:45:28,347 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 14:45:28,347 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 14:45:28,347 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 14:45:28,347 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 14:45:28,347 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 14:45:28,347 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 14:45:28,347 INFO L133 ssoRankerPreferences]: Filename of dumped script: equal-array-sums.bpl_BEv2_Iteration1_Lasso [2022-09-29 14:45:28,347 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 14:45:28,348 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 14:45:28,380 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 14:45:28,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 14:45:28,403 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 14:45:28,473 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 14:45:28,475 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 14:45:28,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 14:45:28,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 14:45:28,499 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 14:45:28,500 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 14:45:28,513 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 14:45:28,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 14:45:28,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 14:45:28,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 14:45:28,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 14:45:28,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 14:45:28,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 14:45:28,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 14:45:28,565 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 14:45:28,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 14:45:28,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 14:45:28,571 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 14:45:28,572 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 14:45:28,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 14:45:28,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 14:45:28,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 14:45:28,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 14:45:28,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 14:45:28,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 14:45:28,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 14:45:28,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 14:45:28,613 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 14:45:28,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 14:45:28,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 14:45:28,615 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 14:45:28,619 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 14:45:28,619 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 14:45:28,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 14:45:28,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 14:45:28,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 14:45:28,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 14:45:28,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 14:45:28,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 14:45:28,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 14:45:28,675 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 14:45:28,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 14:45:28,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 14:45:28,676 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 14:45:28,677 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 14:45:28,678 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 14:45:28,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 14:45:28,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 14:45:28,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 14:45:28,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 14:45:28,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 14:45:28,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 14:45:28,699 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 14:45:28,725 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-09-29 14:45:28,725 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-09-29 14:45:28,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 14:45:28,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 14:45:28,728 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 14:45:28,734 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 14:45:28,737 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 14:45:28,752 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 14:45:28,752 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 14:45:28,753 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, n) = -1*thread1Thread1of1ForFork0_i + 1*n Supporting invariants [] [2022-09-29 14:45:28,793 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 14:45:28,796 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 14:45:28,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 14:45:28,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 14:45:28,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 14:45:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 14:45:28,855 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-29 14:45:28,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 14:45:28,855 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 14:45:28,878 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 14:45:28,880 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 19 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 14:45:28,913 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 19 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 45 states and 101 transitions. Complement of second has 4 states. [2022-09-29 14:45:28,914 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 14:45:28,917 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 14:45:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-09-29 14:45:28,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 3 letters. Loop has 1 letters. [2022-09-29 14:45:28,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 14:45:28,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 4 letters. Loop has 1 letters. [2022-09-29 14:45:28,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 14:45:28,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 3 letters. Loop has 2 letters. [2022-09-29 14:45:28,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 14:45:28,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 101 transitions. [2022-09-29 14:45:28,921 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2022-09-29 14:45:28,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 23 states and 53 transitions. [2022-09-29 14:45:28,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-09-29 14:45:28,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-09-29 14:45:28,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 53 transitions. [2022-09-29 14:45:28,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-09-29 14:45:28,925 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 53 transitions. [2022-09-29 14:45:28,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 53 transitions. [2022-09-29 14:45:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-09-29 14:45:28,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 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 14:45:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2022-09-29 14:45:28,941 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 47 transitions. [2022-09-29 14:45:28,941 INFO L428 stractBuchiCegarLoop]: Abstraction has 20 states and 47 transitions. [2022-09-29 14:45:28,941 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-09-29 14:45:28,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 47 transitions. [2022-09-29 14:45:28,942 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2022-09-29 14:45:28,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:45:28,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:45:28,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-09-29 14:45:28,943 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 14:45:28,943 INFO L733 eck$LassoCheckResult]: Stem: 147#[ULTIMATE.startENTRY]don't care [71] ULTIMATE.startENTRY-->L21: Formula: (and (= v_y_10 0) (= v_x_6 0)) InVars {} OutVars{y=v_y_10, x=v_x_6} AuxVars[] AssignedVars[y, x] 149#[L21]don't care [64] L21-->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] 155#[thread1ENTRY, L21-1]don't care [67] L21-1-->thread2ENTRY: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 159#[thread2ENTRY, thread1ENTRY, L22]don't care [56] thread2ENTRY-->L47-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j] 161#[thread1ENTRY, L47-1, L22]don't care [2022-09-29 14:45:28,943 INFO L735 eck$LassoCheckResult]: Loop: 161#[thread1ENTRY, L47-1, L22]don't care [76] L47-1-->L47-1: Formula: (and (= (+ (select v_A_7 v_thread2Thread1of1ForFork1_j_20) v_y_15) v_y_14) (= v_thread2Thread1of1ForFork1_j_19 (+ v_thread2Thread1of1ForFork1_j_20 1)) (< v_thread2Thread1of1ForFork1_j_20 v_n_13)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, A=v_A_7, n=v_n_13, y=v_y_15} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_19, A=v_A_7, n=v_n_13, y=v_y_14} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, y] 161#[thread1ENTRY, L47-1, L22]don't care [2022-09-29 14:45:28,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:28,943 INFO L85 PathProgramCache]: Analyzing trace with hash 3102319, now seen corresponding path program 1 times [2022-09-29 14:45:28,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:45:28,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744960538] [2022-09-29 14:45:28,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:45:28,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:45:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:28,946 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:45:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:28,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:45:28,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:28,949 INFO L85 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 1 times [2022-09-29 14:45:28,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:45:28,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202829502] [2022-09-29 14:45:28,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:45:28,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:45:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:28,952 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:45:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:28,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:45:28,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:28,954 INFO L85 PathProgramCache]: Analyzing trace with hash 96171965, now seen corresponding path program 1 times [2022-09-29 14:45:28,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:45:28,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75175935] [2022-09-29 14:45:28,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:45:28,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:45:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:28,958 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:45:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:28,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:45:28,997 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 14:45:28,997 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 14:45:28,997 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 14:45:28,997 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 14:45:28,997 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 14:45:28,998 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 14:45:28,998 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 14:45:28,998 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 14:45:28,998 INFO L133 ssoRankerPreferences]: Filename of dumped script: equal-array-sums.bpl_BEv2_Iteration2_Lasso [2022-09-29 14:45:28,998 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 14:45:28,998 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 14:45:28,999 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 14:45:29,007 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 14:45:29,009 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 14:45:29,011 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 14:45:29,012 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 14:45:29,014 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 14:45:29,060 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 14:45:29,061 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 14:45:29,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 14:45:29,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 14:45:29,062 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 14:45:29,063 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 14:45:29,076 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 14:45:29,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 14:45:29,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 14:45:29,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 14:45:29,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 14:45:29,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 14:45:29,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 14:45:29,107 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 14:45:29,122 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-09-29 14:45:29,122 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-09-29 14:45:29,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 14:45:29,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 14:45:29,160 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 14:45:29,161 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 14:45:29,162 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 14:45:29,179 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 14:45:29,179 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 14:45:29,180 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, n) = -1*thread2Thread1of1ForFork1_j + 1*n Supporting invariants [] [2022-09-29 14:45:29,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-09-29 14:45:29,196 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 14:45:29,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 14:45:29,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 14:45:29,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 14:45:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 14:45:29,216 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-29 14:45:29,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 14:45:29,216 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 14:45:29,217 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 14:45:29,217 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 47 transitions. cyclomatic complexity: 34 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 14:45:29,230 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 47 transitions. cyclomatic complexity: 34. 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 36 states and 81 transitions. Complement of second has 4 states. [2022-09-29 14:45:29,230 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 14:45:29,231 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 14:45:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-09-29 14:45:29,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 1 letters. [2022-09-29 14:45:29,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 14:45:29,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 1 letters. [2022-09-29 14:45:29,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 14:45:29,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2022-09-29 14:45:29,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 14:45:29,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 81 transitions. [2022-09-29 14:45:29,233 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-09-29 14:45:29,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2022-09-29 14:45:29,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-09-29 14:45:29,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-09-29 14:45:29,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-09-29 14:45:29,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-29 14:45:29,233 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-09-29 14:45:29,233 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-09-29 14:45:29,233 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-09-29 14:45:29,233 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-09-29 14:45:29,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-09-29 14:45:29,234 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-09-29 14:45:29,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-09-29 14:45:29,238 INFO L202 PluginConnector]: Adding new model equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.09 02:45:29 BoogieIcfgContainer [2022-09-29 14:45:29,238 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-09-29 14:45:29,242 INFO L158 Benchmark]: Toolchain (without parser) took 1735.96ms. Allocated memory is still 185.6MB. Free memory was 141.0MB in the beginning and 112.8MB in the end (delta: 28.1MB). Peak memory consumption was 27.1MB. Max. memory is 8.0GB. [2022-09-29 14:45:29,242 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 14:45:29,243 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.60ms. Allocated memory is still 185.6MB. Free memory was 140.9MB in the beginning and 139.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-29 14:45:29,243 INFO L158 Benchmark]: Boogie Preprocessor took 10.07ms. Allocated memory is still 185.6MB. Free memory was 139.3MB in the beginning and 138.3MB in the end (delta: 974.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 14:45:29,244 INFO L158 Benchmark]: RCFGBuilder took 208.87ms. Allocated memory is still 185.6MB. Free memory was 138.3MB in the beginning and 157.9MB in the end (delta: -19.6MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-09-29 14:45:29,244 INFO L158 Benchmark]: BuchiAutomizer took 1494.80ms. Allocated memory is still 185.6MB. Free memory was 157.9MB in the beginning and 112.8MB in the end (delta: 45.0MB). Peak memory consumption was 42.5MB. Max. memory is 8.0GB. [2022-09-29 14:45:29,248 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.11ms. Allocated memory is still 185.6MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.60ms. Allocated memory is still 185.6MB. Free memory was 140.9MB in the beginning and 139.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 10.07ms. Allocated memory is still 185.6MB. Free memory was 139.3MB in the beginning and 138.3MB in the end (delta: 974.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 208.87ms. Allocated memory is still 185.6MB. Free memory was 138.3MB in the beginning and 157.9MB in the end (delta: -19.6MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 1494.80ms. Allocated memory is still 185.6MB. Free memory was 157.9MB in the beginning and 112.8MB in the end (delta: 45.0MB). Peak memory consumption was 42.5MB. 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). 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. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 7 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital32 mio100 ax100 hnf100 lsp72 ukn91 mio100 lsp57 div100 bol100 ite100 ukn100 eq183 hnf95 smp100 dnf100 smp100 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 73ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - 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.2s, 26 PlacesBefore, 18 PlacesAfterwards, 21 TransitionsBefore, 13 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 63 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 50, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 50, unknown conditional: 0, unknown unconditional: 50] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, 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 14:45:29,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-09-29 14:45:29,488 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 14:45:29,695 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...