/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:52,818 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:52,860 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:37:52,881 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:52,881 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:52,882 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:52,883 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:52,883 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:52,883 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:52,884 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:52,884 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:52,884 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:52,885 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:52,885 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:52,885 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:52,886 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:52,886 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:52,886 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:52,887 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:52,887 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:52,887 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:52,891 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:52,892 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:52,892 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:52,892 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:52,892 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:52,893 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:52,893 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:52,893 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:52,894 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:52,894 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:52,894 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:52,895 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:52,895 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:52,896 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:37:53,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:53,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:53,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:53,133 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:53,134 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:53,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-trans.wvr.bpl [2023-10-12 17:37:53,135 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-trans.wvr.bpl' [2023-10-12 17:37:53,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:53,172 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:53,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:53,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:53,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:53,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:53" (1/1) ... [2023-10-12 17:37:53,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:53" (1/1) ... [2023-10-12 17:37:53,200 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:53,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:53,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:53,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:53,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:53,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:53" (1/1) ... [2023-10-12 17:37:53,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:53" (1/1) ... [2023-10-12 17:37:53,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:53" (1/1) ... [2023-10-12 17:37:53,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:53" (1/1) ... [2023-10-12 17:37:53,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:53" (1/1) ... [2023-10-12 17:37:53,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:53" (1/1) ... [2023-10-12 17:37:53,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:53" (1/1) ... [2023-10-12 17:37:53,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:53" (1/1) ... [2023-10-12 17:37:53,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:53,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:53,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:53,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:53,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:53" (1/1) ... [2023-10-12 17:37:53,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:53,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:53,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:53,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:37:53,300 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:37:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:37:53,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:37:53,303 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:37:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:37:53,304 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:37:53,304 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:53,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:53,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:53,304 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:37:53,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:37:53,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:37:53,306 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:37:53,357 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:53,359 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:53,468 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:53,508 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:53,508 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-10-12 17:37:53,509 WARN L332 CfgBuilder]: Unexpected successor node of atomic block begin: thread1EXIT is neither atomic block end nor error location. [2023-10-12 17:37:53,510 WARN L332 CfgBuilder]: Unexpected successor node of atomic block begin: thread2EXIT is neither atomic block end nor error location. [2023-10-12 17:37:53,510 WARN L332 CfgBuilder]: Unexpected successor node of atomic block begin: thread3EXIT is neither atomic block end nor error location. [2023-10-12 17:37:53,511 INFO L201 PluginConnector]: Adding new model array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:53 BoogieIcfgContainer [2023-10-12 17:37:53,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:53,513 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:53,513 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:53,516 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:53,516 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:53,517 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:53" (1/2) ... [2023-10-12 17:37:53,522 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@750b380c and model type array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:53, skipping insertion in model container [2023-10-12 17:37:53,522 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:53,522 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:53" (2/2) ... [2023-10-12 17:37:53,523 INFO L332 chiAutomizerObserver]: Analyzing ICFG array-int-trans.wvr.bpl [2023-10-12 17:37:53,611 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:37:53,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 74 flow [2023-10-12 17:37:53,662 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2023-10-12 17:37:53,662 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:37:53,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 3/19 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2023-10-12 17:37:53,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 25 transitions, 74 flow [2023-10-12 17:37:53,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 19 transitions, 56 flow [2023-10-12 17:37:53,672 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:53,683 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 19 transitions, 56 flow [2023-10-12 17:37:53,685 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 56 flow [2023-10-12 17:37:53,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 56 flow [2023-10-12 17:37:53,691 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2023-10-12 17:37:53,691 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:37:53,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 3/19 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2023-10-12 17:37:53,692 INFO L119 LiptonReduction]: Number of co-enabled transitions 90 [2023-10-12 17:37:53,735 INFO L134 LiptonReduction]: Checked pairs total: 72 [2023-10-12 17:37:53,735 INFO L136 LiptonReduction]: Total number of compositions: 3 [2023-10-12 17:37:53,746 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:53,746 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:53,746 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:53,746 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:53,746 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:53,746 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:53,746 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:53,747 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:53,747 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 17 transitions, 52 flow [2023-10-12 17:37:53,750 ERROR L47 etriNetUnfolderRabin]: [1:1A:[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][11], 3:2A:[86] $Ultimate##0-->L34: Formula: (and (not v_break_7_9) (= v_i_6_12 0) (= (+ v_result_8_9 v_len_3_9) v_len_1_11)) InVars {len_1=v_len_1_11, len_3=v_len_3_9} OutVars{result_8=v_result_8_9, i_6=v_i_6_12, len_1=v_len_1_11, len_3=v_len_3_9, break_7=v_break_7_9} AuxVars[] AssignedVars[result_8, i_6, break_7][2]][4:3A:[88] L34-->L34: Formula: (let ((.cse1 (select v_array_0_11 v_i_6_20)) (.cse2 (select v_array_2_9 v_i_6_20))) (let ((.cse0 (= .cse1 .cse2))) (and (< v_i_6_21 v_len_3_17) (= v_result_8_11 (ite .cse0 v_result_8_12 (+ .cse1 (* (- 1) .cse2)))) (or (and (not .cse0) v_break_7_15) (and .cse0 (not v_break_7_15))) (= (+ v_i_6_21 1) v_i_6_20) (< v_i_6_21 v_len_1_23) (not v_break_7_16)))) InVars {result_8=v_result_8_12, i_6=v_i_6_21, len_1=v_len_1_23, array_2=v_array_2_9, len_3=v_len_3_17, break_7=v_break_7_16, array_0=v_array_0_11} OutVars{result_8=v_result_8_11, i_6=v_i_6_20, len_1=v_len_1_23, array_2=v_array_2_9, break_7=v_break_7_15, len_3=v_len_3_17, array_0=v_array_0_11} AuxVars[] AssignedVars[result_8, i_6, break_7][6]] [2023-10-12 17:37:53,752 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:53,752 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:37:53,752 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:53,752 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:53,759 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:53,759 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 17 transitions, 52 flow [2023-10-12 17:37:53,765 ERROR L47 etriNetUnfolderRabin]: [1:1A:[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][11], 3:2A:[86] $Ultimate##0-->L34: Formula: (and (not v_break_7_9) (= v_i_6_12 0) (= (+ v_result_8_9 v_len_3_9) v_len_1_11)) InVars {len_1=v_len_1_11, len_3=v_len_3_9} OutVars{result_8=v_result_8_9, i_6=v_i_6_12, len_1=v_len_1_11, len_3=v_len_3_9, break_7=v_break_7_9} AuxVars[] AssignedVars[result_8, i_6, break_7][2]][4:3A:[88] L34-->L34: Formula: (let ((.cse1 (select v_array_0_11 v_i_6_20)) (.cse2 (select v_array_2_9 v_i_6_20))) (let ((.cse0 (= .cse1 .cse2))) (and (< v_i_6_21 v_len_3_17) (= v_result_8_11 (ite .cse0 v_result_8_12 (+ .cse1 (* (- 1) .cse2)))) (or (and (not .cse0) v_break_7_15) (and .cse0 (not v_break_7_15))) (= (+ v_i_6_21 1) v_i_6_20) (< v_i_6_21 v_len_1_23) (not v_break_7_16)))) InVars {result_8=v_result_8_12, i_6=v_i_6_21, len_1=v_len_1_23, array_2=v_array_2_9, len_3=v_len_3_17, break_7=v_break_7_16, array_0=v_array_0_11} OutVars{result_8=v_result_8_11, i_6=v_i_6_20, len_1=v_len_1_23, array_2=v_array_2_9, break_7=v_break_7_15, len_3=v_len_3_17, array_0=v_array_0_11} AuxVars[] AssignedVars[result_8, i_6, break_7][6]] [2023-10-12 17:37:53,765 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:53,765 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:37:53,765 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:53,765 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:53,769 INFO L748 eck$LassoCheckResult]: Stem: 33#[$Ultimate##0]true [97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 35#[L85, $Ultimate##0]true [86] $Ultimate##0-->L34: Formula: (and (not v_break_7_9) (= v_i_6_12 0) (= (+ v_result_8_9 v_len_3_9) v_len_1_11)) InVars {len_1=v_len_1_11, len_3=v_len_3_9} OutVars{result_8=v_result_8_9, i_6=v_i_6_12, len_1=v_len_1_11, len_3=v_len_3_9, break_7=v_break_7_9} AuxVars[] AssignedVars[result_8, i_6, break_7] 37#[L85, L34]true [2023-10-12 17:37:53,769 INFO L750 eck$LassoCheckResult]: Loop: 37#[L85, L34]true [88] L34-->L34: Formula: (let ((.cse1 (select v_array_0_11 v_i_6_20)) (.cse2 (select v_array_2_9 v_i_6_20))) (let ((.cse0 (= .cse1 .cse2))) (and (< v_i_6_21 v_len_3_17) (= v_result_8_11 (ite .cse0 v_result_8_12 (+ .cse1 (* (- 1) .cse2)))) (or (and (not .cse0) v_break_7_15) (and .cse0 (not v_break_7_15))) (= (+ v_i_6_21 1) v_i_6_20) (< v_i_6_21 v_len_1_23) (not v_break_7_16)))) InVars {result_8=v_result_8_12, i_6=v_i_6_21, len_1=v_len_1_23, array_2=v_array_2_9, len_3=v_len_3_17, break_7=v_break_7_16, array_0=v_array_0_11} OutVars{result_8=v_result_8_11, i_6=v_i_6_20, len_1=v_len_1_23, array_2=v_array_2_9, break_7=v_break_7_15, len_3=v_len_3_17, array_0=v_array_0_11} AuxVars[] AssignedVars[result_8, i_6, break_7] 37#[L85, L34]true [2023-10-12 17:37:53,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:53,774 INFO L85 PathProgramCache]: Analyzing trace with hash 4054, now seen corresponding path program 1 times [2023-10-12 17:37:53,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:53,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014429025] [2023-10-12 17:37:53,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:53,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:53,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:53,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:53,901 INFO L85 PathProgramCache]: Analyzing trace with hash 119, now seen corresponding path program 1 times [2023-10-12 17:37:53,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:53,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170724315] [2023-10-12 17:37:53,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:53,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:53,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:53,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:53,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:53,931 INFO L85 PathProgramCache]: Analyzing trace with hash 125762, now seen corresponding path program 1 times [2023-10-12 17:37:53,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:53,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976567595] [2023-10-12 17:37:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:53,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:53,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:53,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:54,134 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:54,134 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:54,135 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:54,135 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:54,135 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:54,135 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:54,135 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:54,135 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:54,136 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-int-trans.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:54,136 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:54,136 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:54,151 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:54,226 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:54,437 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:54,441 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:54,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:54,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:54,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:54,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:54,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:54,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:54,466 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:37:54,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:54,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:37:54,524 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:37:54,525 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:37:54,610 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:54,660 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:37:54,661 INFO L444 ModelExtractionUtils]: 48 out of 57 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:37:54,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:54,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:54,665 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:54,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:37:54,668 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:54,701 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2023-10-12 17:37:54,701 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:54,702 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_3, i_6) = 1*len_3 - 1*i_6 Supporting invariants [] [2023-10-12 17:37:54,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:54,717 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:54,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:54,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:54,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:54,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:54,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:54,808 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:54,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2023-10-12 17:37:54,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:37:54,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:54,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:54,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:54,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:37:54,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:54,893 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 85 transitions, 430 flow [2023-10-12 17:37:54,893 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:54,893 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 85 transitions, 430 flow [2023-10-12 17:37:54,897 ERROR L47 etriNetUnfolderRabin]: [1:1A:[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][57], 2:2A:[100] L85-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][7], 13:3A:[89] $Ultimate##0-->L53: Formula: (and (not v_break_10_15) (= v_i_9_18 0) (= v_len_3_21 (+ v_result_11_15 v_len_5_23))) InVars {len_5=v_len_5_23, len_3=v_len_3_21} OutVars{len_5=v_len_5_23, result_11=v_result_11_15, break_10=v_break_10_15, len_3=v_len_3_21, i_9=v_i_9_18} AuxVars[] AssignedVars[result_11, break_10, i_9][52]][15:4A:[90] L53-->L53: Formula: (let ((.cse1 (select v_array_2_11 v_i_9_14)) (.cse2 (select v_array_4_11 v_i_9_14))) (let ((.cse0 (= .cse1 .cse2))) (and (= v_result_11_11 (ite .cse0 v_result_11_12 (+ .cse1 (* (- 1) .cse2)))) (= (+ v_i_9_15 1) v_i_9_14) (or (and (not v_break_10_11) .cse0) (and (not .cse0) v_break_10_11)) (< v_i_9_15 v_len_3_19) (< v_i_9_15 v_len_5_21) (not v_break_10_12)))) InVars {result_11=v_result_11_12, break_10=v_break_10_12, array_4=v_array_4_11, array_2=v_array_2_11, len_3=v_len_3_19, len_5=v_len_5_21, i_9=v_i_9_15} OutVars{result_11=v_result_11_11, break_10=v_break_10_11, array_4=v_array_4_11, array_2=v_array_2_11, len_3=v_len_3_19, len_5=v_len_5_21, i_9=v_i_9_14} AuxVars[] AssignedVars[result_11, break_10, i_9][62]] [2023-10-12 17:37:54,898 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:54,898 INFO L124 PetriNetUnfolderBase]: 7/14 cut-off events. [2023-10-12 17:37:54,898 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:37:54,898 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:54,899 INFO L748 eck$LassoCheckResult]: Stem: 33#[$Ultimate##0]true [97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 35#[L85, $Ultimate##0]true [100] L85-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 72#[L86, $Ultimate##0, $Ultimate##0]true [89] $Ultimate##0-->L53: Formula: (and (not v_break_10_15) (= v_i_9_18 0) (= v_len_3_21 (+ v_result_11_15 v_len_5_23))) InVars {len_5=v_len_5_23, len_3=v_len_3_21} OutVars{len_5=v_len_5_23, result_11=v_result_11_15, break_10=v_break_10_15, len_3=v_len_3_21, i_9=v_i_9_18} AuxVars[] AssignedVars[result_11, break_10, i_9] 74#[L86, $Ultimate##0, L53]true [2023-10-12 17:37:54,899 INFO L750 eck$LassoCheckResult]: Loop: 74#[L86, $Ultimate##0, L53]true [90] L53-->L53: Formula: (let ((.cse1 (select v_array_2_11 v_i_9_14)) (.cse2 (select v_array_4_11 v_i_9_14))) (let ((.cse0 (= .cse1 .cse2))) (and (= v_result_11_11 (ite .cse0 v_result_11_12 (+ .cse1 (* (- 1) .cse2)))) (= (+ v_i_9_15 1) v_i_9_14) (or (and (not v_break_10_11) .cse0) (and (not .cse0) v_break_10_11)) (< v_i_9_15 v_len_3_19) (< v_i_9_15 v_len_5_21) (not v_break_10_12)))) InVars {result_11=v_result_11_12, break_10=v_break_10_12, array_4=v_array_4_11, array_2=v_array_2_11, len_3=v_len_3_19, len_5=v_len_5_21, i_9=v_i_9_15} OutVars{result_11=v_result_11_11, break_10=v_break_10_11, array_4=v_array_4_11, array_2=v_array_2_11, len_3=v_len_3_19, len_5=v_len_5_21, i_9=v_i_9_14} AuxVars[] AssignedVars[result_11, break_10, i_9] 74#[L86, $Ultimate##0, L53]true [2023-10-12 17:37:54,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:54,900 INFO L85 PathProgramCache]: Analyzing trace with hash 126197, now seen corresponding path program 1 times [2023-10-12 17:37:54,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:54,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698880816] [2023-10-12 17:37:54,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:54,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:54,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:54,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:54,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:54,911 INFO L85 PathProgramCache]: Analyzing trace with hash 121, now seen corresponding path program 1 times [2023-10-12 17:37:54,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:54,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774785742] [2023-10-12 17:37:54,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:54,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:54,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:54,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:54,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:54,923 INFO L85 PathProgramCache]: Analyzing trace with hash 3912197, now seen corresponding path program 1 times [2023-10-12 17:37:54,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:54,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967680746] [2023-10-12 17:37:54,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:54,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:54,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:54,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:55,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:55,077 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:55,077 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:55,077 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:55,077 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:55,077 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:55,077 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:55,077 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:55,078 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:55,078 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-int-trans.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:55,078 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:55,078 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:55,080 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:55,137 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:55,140 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:55,143 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:55,350 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:55,350 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:55,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:55,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:55,353 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:55,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:55,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:55,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:55,373 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:37:55,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:55,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:37:55,407 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:37:55,408 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:37:55,479 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:55,512 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:37:55,513 INFO L444 ModelExtractionUtils]: 48 out of 57 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:37:55,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:55,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:55,514 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:55,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:37:55,541 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:55,565 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2023-10-12 17:37:55,566 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:55,566 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_9, len_3) = -1*i_9 + 1*len_3 Supporting invariants [] [2023-10-12 17:37:55,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:55,575 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:55,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:55,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:55,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:55,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:55,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:55,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:55,606 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:55,667 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) [2023-10-12 17:37:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2023-10-12 17:37:55,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:55,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:55,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:55,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:55,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:55,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:55,670 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 425 transitions, 3000 flow [2023-10-12 17:37:55,670 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:55,670 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 425 transitions, 3000 flow [2023-10-12 17:37:55,678 ERROR L47 etriNetUnfolderRabin]: [1:1A:[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][285], 2:2A:[100] L85-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][35], 5:3A:[103] L86-->$Ultimate##0: 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} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][10], 26:4A:[92] $Ultimate##0-->L72: Formula: (and (= v_len_1_15 (+ v_result_14_11 v_len_5_15)) (= v_i_12_14 0) (not v_break_13_11)) InVars {len_1=v_len_1_15, len_5=v_len_5_15} OutVars{len_5=v_len_5_15, i_12=v_i_12_14, result_14=v_result_14_11, len_1=v_len_1_15, break_13=v_break_13_11} AuxVars[] AssignedVars[result_14, i_12, break_13][360]][27:5A:[93] L72-->L72: Formula: (let ((.cse1 (select v_array_4_9 v_i_12_16)) (.cse2 (select v_array_0_9 v_i_12_16))) (let ((.cse0 (= .cse1 .cse2))) (and (or (and (not v_break_13_13) .cse0) (and (not .cse0) v_break_13_13)) (not v_break_13_14) (= (+ v_i_12_17 1) v_i_12_16) (< v_i_12_17 v_len_5_17) (< v_i_12_17 v_len_1_17) (= v_result_14_13 (ite .cse0 v_result_14_14 (+ (* (- 1) .cse1) .cse2)))))) InVars {result_14=v_result_14_14, array_4=v_array_4_9, len_1=v_len_1_17, array_0=v_array_0_9, len_5=v_len_5_17, i_12=v_i_12_17, break_13=v_break_13_14} OutVars{result_14=v_result_14_13, array_4=v_array_4_9, len_1=v_len_1_17, array_0=v_array_0_9, len_5=v_len_5_17, i_12=v_i_12_16, break_13=v_break_13_13} AuxVars[] AssignedVars[result_14, i_12, break_13][210]] [2023-10-12 17:37:55,678 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:55,679 INFO L124 PetriNetUnfolderBase]: 14/26 cut-off events. [2023-10-12 17:37:55,679 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:37:55,679 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:55,679 INFO L748 eck$LassoCheckResult]: Stem: 33#[$Ultimate##0]true [97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 35#[L85, $Ultimate##0]true [100] L85-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 72#[L86, $Ultimate##0, $Ultimate##0]true [103] L86-->$Ultimate##0: 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} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 108#[$Ultimate##0, $Ultimate##0, L87, $Ultimate##0]true [92] $Ultimate##0-->L72: Formula: (and (= v_len_1_15 (+ v_result_14_11 v_len_5_15)) (= v_i_12_14 0) (not v_break_13_11)) InVars {len_1=v_len_1_15, len_5=v_len_5_15} OutVars{len_5=v_len_5_15, i_12=v_i_12_14, result_14=v_result_14_11, len_1=v_len_1_15, break_13=v_break_13_11} AuxVars[] AssignedVars[result_14, i_12, break_13] 110#[$Ultimate##0, $Ultimate##0, L87, L72]true [2023-10-12 17:37:55,679 INFO L750 eck$LassoCheckResult]: Loop: 110#[$Ultimate##0, $Ultimate##0, L87, L72]true [93] L72-->L72: Formula: (let ((.cse1 (select v_array_4_9 v_i_12_16)) (.cse2 (select v_array_0_9 v_i_12_16))) (let ((.cse0 (= .cse1 .cse2))) (and (or (and (not v_break_13_13) .cse0) (and (not .cse0) v_break_13_13)) (not v_break_13_14) (= (+ v_i_12_17 1) v_i_12_16) (< v_i_12_17 v_len_5_17) (< v_i_12_17 v_len_1_17) (= v_result_14_13 (ite .cse0 v_result_14_14 (+ (* (- 1) .cse1) .cse2)))))) InVars {result_14=v_result_14_14, array_4=v_array_4_9, len_1=v_len_1_17, array_0=v_array_0_9, len_5=v_len_5_17, i_12=v_i_12_17, break_13=v_break_13_14} OutVars{result_14=v_result_14_13, array_4=v_array_4_9, len_1=v_len_1_17, array_0=v_array_0_9, len_5=v_len_5_17, i_12=v_i_12_16, break_13=v_break_13_13} AuxVars[] AssignedVars[result_14, i_12, break_13] 110#[$Ultimate##0, $Ultimate##0, L87, L72]true [2023-10-12 17:37:55,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:55,680 INFO L85 PathProgramCache]: Analyzing trace with hash 3912633, now seen corresponding path program 1 times [2023-10-12 17:37:55,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:55,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954828569] [2023-10-12 17:37:55,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:55,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:55,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:55,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:55,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:55,703 INFO L85 PathProgramCache]: Analyzing trace with hash 124, now seen corresponding path program 1 times [2023-10-12 17:37:55,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:55,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525162365] [2023-10-12 17:37:55,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:55,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:55,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:55,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:55,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:55,715 INFO L85 PathProgramCache]: Analyzing trace with hash 121291716, now seen corresponding path program 1 times [2023-10-12 17:37:55,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:55,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637400556] [2023-10-12 17:37:55,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:55,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:55,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:55,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:55,875 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:55,875 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:55,875 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:55,875 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:55,875 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:55,876 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:55,876 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:55,876 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:55,876 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-int-trans.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:37:55,876 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:55,876 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:55,880 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:55,884 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:55,938 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:55,941 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:55,947 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:55,950 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:55,953 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:56,152 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:56,152 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:56,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:56,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:56,157 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:56,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:37:56,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:56,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:56,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:56,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:56,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:56,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:56,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:56,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:56,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:56,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:56,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:56,190 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:56,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:37:56,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:56,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:56,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:56,203 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:37:56,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:56,244 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:37:56,244 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:37:56,308 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:56,342 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:37:56,342 INFO L444 ModelExtractionUtils]: 48 out of 57 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:37:56,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:56,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:56,346 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:56,358 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:56,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:37:56,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:37:56,388 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2023-10-12 17:37:56,388 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:56,389 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_5, i_12) = 1*len_5 - 1*i_12 Supporting invariants [] [2023-10-12 17:37:56,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:56,400 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:56,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:56,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:56,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:56,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:56,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:56,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:56,430 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2023-10-12 17:37:56,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:56,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:56,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:56,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:56,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:37:56,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:56,484 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 2125 transitions, 19250 flow [2023-10-12 17:37:56,485 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:37:56,485 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 39 places, 2125 transitions, 19250 flow [2023-10-12 17:37:56,588 INFO L124 PetriNetUnfolderBase]: 193/281 cut-off events. [2023-10-12 17:37:56,588 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-10-12 17:37:56,588 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:37:56,598 INFO L201 PluginConnector]: Adding new model array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:56 BoogieIcfgContainer [2023-10-12 17:37:56,598 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:56,599 INFO L158 Benchmark]: Toolchain (without parser) took 3426.57ms. Allocated memory was 186.6MB in the beginning and 256.9MB in the end (delta: 70.3MB). Free memory was 141.2MB in the beginning and 195.8MB in the end (delta: -54.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-10-12 17:37:56,600 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 186.6MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:56,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.69ms. Allocated memory is still 186.6MB. Free memory was 141.1MB in the beginning and 139.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:37:56,601 INFO L158 Benchmark]: Boogie Preprocessor took 33.36ms. Allocated memory is still 186.6MB. Free memory was 139.6MB in the beginning and 138.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:56,603 INFO L158 Benchmark]: RCFGBuilder took 275.67ms. Allocated memory is still 186.6MB. Free memory was 138.4MB in the beginning and 125.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-10-12 17:37:56,605 INFO L158 Benchmark]: BuchiAutomizer took 3085.56ms. Allocated memory was 186.6MB in the beginning and 256.9MB in the end (delta: 70.3MB). Free memory was 124.9MB in the beginning and 195.8MB in the end (delta: -70.9MB). Peak memory consumption was 55.8kB. Max. memory is 8.0GB. [2023-10-12 17:37:56,609 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.27ms. Allocated memory is still 186.6MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.69ms. Allocated memory is still 186.6MB. Free memory was 141.1MB in the beginning and 139.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.36ms. Allocated memory is still 186.6MB. Free memory was 139.6MB in the beginning and 138.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 275.67ms. Allocated memory is still 186.6MB. Free memory was 138.4MB in the beginning and 125.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3085.56ms. Allocated memory was 186.6MB in the beginning and 256.9MB in the end (delta: 70.3MB). Free memory was 124.9MB in the beginning and 195.8MB in the end (delta: -70.9MB). Peak memory consumption was 55.8kB. 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len_3 + -1 * i_6 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_9 + len_3 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_12 + len_5 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 144 IncrementalHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 54 mSDtfsCounter, 144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital86 mio100 ax100 hnf100 lsp101 ukn62 mio100 lsp100 div100 bol109 ite100 ukn100 eq171 hnf97 smp100 dnf232 smp56 tf100 neg100 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 259ms VariablesStem: 5 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s - 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.0s, 26 PlacesBefore, 24 PlacesAfterwards, 19 TransitionsBefore, 17 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , 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, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:37:56,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:56,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...