/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 BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:31:55,435 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:31:55,472 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:31:55,496 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:31:55,496 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:31:55,501 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:31:55,502 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:31:55,503 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:31:55,503 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:31:55,506 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:31:55,506 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:31:55,506 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:31:55,506 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:31:55,507 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:31:55,508 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:31:55,508 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:31:55,508 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:31:55,508 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:31:55,509 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:31:55,509 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:31:55,509 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:31:55,509 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:31:55,510 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:31:55,510 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:31:55,510 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:31:55,511 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:31:55,511 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:31:55,511 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:31:55,511 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:31:55,511 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:31:55,512 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:31:55,512 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:31:55,512 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:31:55,514 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:31:55,514 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 -> BUCHI_PETRI_NET [2023-10-12 17:31:55,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:31:55,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:31:55,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:31:55,736 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:31:55,736 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:31:55,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl [2023-10-12 17:31:55,738 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl' [2023-10-12 17:31:55,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:31:55,761 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:31:55,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:31:55,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:31:55,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:31:55,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:55" (1/1) ... [2023-10-12 17:31:55,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:55" (1/1) ... [2023-10-12 17:31:55,782 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:31:55,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:31:55,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:31:55,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:31:55,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:31:55,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:55" (1/1) ... [2023-10-12 17:31:55,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:55" (1/1) ... [2023-10-12 17:31:55,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:55" (1/1) ... [2023-10-12 17:31:55,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:55" (1/1) ... [2023-10-12 17:31:55,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:55" (1/1) ... [2023-10-12 17:31:55,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:55" (1/1) ... [2023-10-12 17:31:55,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:55" (1/1) ... [2023-10-12 17:31:55,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:55" (1/1) ... [2023-10-12 17:31:55,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:31:55,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:31:55,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:31:55,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:31:55,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:55" (1/1) ... [2023-10-12 17:31:55,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:55,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:55,833 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:31:55,849 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:31:55,871 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:31:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:31:55,873 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:31:55,874 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:31:55,874 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:31:55,874 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:31:55,875 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:31:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:31:55,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:31:55,875 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:31:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:31:55,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:31:55,876 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:31:55,923 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:31:55,925 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:31:56,018 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:31:56,031 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:31:56,032 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:31:56,033 INFO L201 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:31:56 BoogieIcfgContainer [2023-10-12 17:31:56,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:31:56,034 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:31:56,034 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:31:56,063 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:31:56,064 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:31:56,064 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:55" (1/2) ... [2023-10-12 17:31:56,072 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13ea11d7 and model type simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:31:56, skipping insertion in model container [2023-10-12 17:31:56,072 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:31:56,073 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:31:56" (2/2) ... [2023-10-12 17:31:56,074 INFO L332 chiAutomizerObserver]: Analyzing ICFG simple-array-sum.wvr.bpl [2023-10-12 17:31:56,115 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:31:56,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 88 flow [2023-10-12 17:31:56,154 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2023-10-12 17:31:56,154 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:31:56,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:31:56,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 88 flow [2023-10-12 17:31:56,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 26 transitions, 70 flow [2023-10-12 17:31:56,163 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:31:56,172 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 70 flow [2023-10-12 17:31:56,174 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 70 flow [2023-10-12 17:31:56,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 70 flow [2023-10-12 17:31:56,179 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2023-10-12 17:31:56,179 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:31:56,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:31:56,180 INFO L119 LiptonReduction]: Number of co-enabled transitions 184 [2023-10-12 17:31:56,404 INFO L134 LiptonReduction]: Checked pairs total: 146 [2023-10-12 17:31:56,404 INFO L136 LiptonReduction]: Total number of compositions: 11 [2023-10-12 17:31:56,415 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:31:56,415 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:31:56,416 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:31:56,416 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:31:56,416 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:31:56,416 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:31:56,416 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:31:56,416 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:31:56,417 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 places, 17 transitions, 52 flow [2023-10-12 17:31:56,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:56,421 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:31:56,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:31:56,421 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:56,423 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:31:56,423 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 places, 17 transitions, 52 flow [2023-10-12 17:31:56,424 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:56,424 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:31:56,424 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:31:56,424 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:56,428 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [108] $Ultimate##0-->L61: Formula: (and (= v_i_17 v_l_19) (= v_i_17 v_csum_13) (= v_i_17 v_p_13) (= v_i_17 v_k_22) (= v_asum_17 v_i_17) (<= 0 v_N_27) (= v_i_17 0)) InVars {csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} OutVars{csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} AuxVars[] AssignedVars[] 41#[L61]true [89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L23-1, L61-1]true [2023-10-12 17:31:56,428 INFO L750 eck$LassoCheckResult]: Loop: 43#[L23-1, L61-1]true [107] L23-1-->L23-1: Formula: (and (< v_i_14 v_N_25) (= v_i_13 (+ v_i_14 1)) (= v_asum_13 (+ (select v_A_11 v_i_14) v_asum_14))) InVars {A=v_A_11, N=v_N_25, i=v_i_14, asum=v_asum_14} OutVars{A=v_A_11, N=v_N_25, i=v_i_13, asum=v_asum_13} AuxVars[] AssignedVars[i, asum] 43#[L23-1, L61-1]true [2023-10-12 17:31:56,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:56,432 INFO L85 PathProgramCache]: Analyzing trace with hash 4398, now seen corresponding path program 1 times [2023-10-12 17:31:56,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:56,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929434981] [2023-10-12 17:31:56,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:56,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:56,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:56,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:56,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash 138, now seen corresponding path program 1 times [2023-10-12 17:31:56,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:56,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581560887] [2023-10-12 17:31:56,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:56,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:56,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:56,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:56,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash 136445, now seen corresponding path program 1 times [2023-10-12 17:31:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:56,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064472477] [2023-10-12 17:31:56,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:56,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:56,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:56,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:56,623 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:31:56,624 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:31:56,624 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:31:56,624 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:31:56,624 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:31:56,624 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:56,624 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:31:56,624 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:31:56,624 INFO L133 ssoRankerPreferences]: Filename of dumped script: simple-array-sum.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:31:56,624 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:31:56,625 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:31:56,635 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:31:56,642 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:31:56,645 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:31:56,660 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:31:56,663 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:31:56,665 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:31:56,726 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:31:56,729 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:31:56,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:56,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:56,747 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:31:56,748 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:31:56,749 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:31:56,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:56,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:56,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:56,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:56,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:56,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:56,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:56,784 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:31:56,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:56,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:56,786 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:31:56,786 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:31:56,789 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:31:56,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:56,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:56,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:56,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:56,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:56,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:56,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:56,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:31:56,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:56,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:56,820 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:31:56,824 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:31:56,825 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:31:56,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:56,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:56,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:56,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:56,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:56,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:56,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:56,864 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:31:56,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:56,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:56,866 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:31:56,875 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:31:56,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:56,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:56,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:56,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:56,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:56,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:56,896 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:31:56,906 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:31:56,940 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:31:56,940 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:31:56,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:56,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:56,945 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:31:56,946 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:31:56,947 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:31:56,975 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:31:56,976 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:31:56,976 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:31:56,986 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:31:56,988 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:31:57,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:57,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:31:57,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:57,042 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:31:57,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:57,046 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:31:57,080 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:31:57,081 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:31:57,165 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:31:57,183 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. 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) Result 5 states and 250 transitions. [2023-10-12 17:31:57,184 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:31:57,190 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:31:57,192 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:31:57,196 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:31:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2023-10-12 17:31:57,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 172 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:31:57,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:57,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 172 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:31:57,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:57,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 172 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:31:57,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:57,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 196 transitions, 1000 flow [2023-10-12 17:31:57,251 INFO L124 PetriNetUnfolderBase]: 207/302 cut-off events. [2023-10-12 17:31:57,251 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-10-12 17:31:57,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 302 events. 207/302 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 894 event pairs, 29 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 468. Up to 104 conditions per place. [2023-10-12 17:31:57,253 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 33 places, 196 transitions, 1000 flow [2023-10-12 17:31:57,258 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 33 places, 196 transitions, 1000 flow [2023-10-12 17:31:57,259 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 196 transitions, 1000 flow [2023-10-12 17:31:57,259 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:31:57,259 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 places, 196 transitions, 1000 flow [2023-10-12 17:31:57,273 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:57,273 INFO L124 PetriNetUnfolderBase]: 26/40 cut-off events. [2023-10-12 17:31:57,273 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-10-12 17:31:57,273 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:57,273 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [108] $Ultimate##0-->L61: Formula: (and (= v_i_17 v_l_19) (= v_i_17 v_csum_13) (= v_i_17 v_p_13) (= v_i_17 v_k_22) (= v_asum_17 v_i_17) (<= 0 v_N_27) (= v_i_17 0)) InVars {csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} OutVars{csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} AuxVars[] AssignedVars[] 41#[L61]true [89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L23-1, L61-1]true [92] L61-1-->L34-1: 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] 88#[L23-1, L62, L34-1]true [2023-10-12 17:31:57,274 INFO L750 eck$LassoCheckResult]: Loop: 88#[L23-1, L62, L34-1]true [105] L34-1-->L34-1: Formula: (and (= v_k_18 (+ v_k_19 1)) (= v_C_14 (store v_C_15 v_k_19 (+ (select v_A_9 v_k_19) 1))) (< v_k_19 v_N_21) (= v_k_18 v_p_11)) InVars {A=v_A_9, N=v_N_21, k=v_k_19, C=v_C_15} OutVars{A=v_A_9, p=v_p_11, N=v_N_21, k=v_k_18, C=v_C_14} AuxVars[] AssignedVars[p, k, C] 88#[L23-1, L62, L34-1]true [105] L34-1-->L34-1: Formula: (and (= v_k_18 (+ v_k_19 1)) (= v_C_14 (store v_C_15 v_k_19 (+ (select v_A_9 v_k_19) 1))) (< v_k_19 v_N_21) (= v_k_18 v_p_11)) InVars {A=v_A_9, N=v_N_21, k=v_k_19, C=v_C_15} OutVars{A=v_A_9, p=v_p_11, N=v_N_21, k=v_k_18, C=v_C_14} AuxVars[] AssignedVars[p, k, C] 88#[L23-1, L62, L34-1]true [2023-10-12 17:31:57,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:57,274 INFO L85 PathProgramCache]: Analyzing trace with hash 136430, now seen corresponding path program 1 times [2023-10-12 17:31:57,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:57,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438870360] [2023-10-12 17:31:57,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:57,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:57,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:57,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:57,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:57,297 INFO L85 PathProgramCache]: Analyzing trace with hash 4321, now seen corresponding path program 1 times [2023-10-12 17:31:57,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:57,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054095603] [2023-10-12 17:31:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:57,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:57,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:57,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:57,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:57,318 INFO L85 PathProgramCache]: Analyzing trace with hash 131112590, now seen corresponding path program 1 times [2023-10-12 17:31:57,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:57,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066495159] [2023-10-12 17:31:57,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:57,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:57,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:57,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:57,458 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:31:57,458 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:31:57,458 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:31:57,460 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:31:57,460 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:31:57,460 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:57,460 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:31:57,460 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:31:57,460 INFO L133 ssoRankerPreferences]: Filename of dumped script: simple-array-sum.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:31:57,460 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:31:57,460 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:31:57,462 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:31:57,464 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:31:57,467 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:31:57,470 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:31:57,497 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:31:57,500 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:31:57,502 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:31:57,505 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:31:57,579 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:31:57,579 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:31:57,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:57,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:57,585 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:31:57,588 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:31:57,589 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:31:57,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:57,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:57,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:57,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:57,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:57,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:57,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:57,614 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:31:57,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:57,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:57,615 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:31:57,618 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:31:57,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 [2023-10-12 17:31:57,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:57,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:57,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:57,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:57,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:57,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:57,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:57,660 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:31:57,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:57,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:57,661 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:31:57,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:31:57,665 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:31:57,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:57,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:57,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:57,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:57,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:57,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:57,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:57,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:31:57,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:57,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:57,691 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:31:57,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:31:57,694 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:31:57,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:57,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:57,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:57,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:57,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:57,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:57,725 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:31:57,756 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-10-12 17:31:57,756 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:31:57,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:57,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:57,760 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:31:57,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:31:57,763 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:31:57,769 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:31:57,770 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:31:57,770 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:31:57,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:31:57,781 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:31:57,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:57,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:31:57,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:57,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:31:57,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:57,824 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:31:57,824 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:31:57,959 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 7 states and 330 transitions. [2023-10-12 17:31:57,959 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:31:57,986 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:31:57,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:31:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:31:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2023-10-12 17:31:57,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 215 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:31:57,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:57,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 215 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:31:57,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:57,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 215 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:31:57,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:57,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 2992 transitions, 21408 flow [2023-10-12 17:31:58,133 INFO L124 PetriNetUnfolderBase]: 613/866 cut-off events. [2023-10-12 17:31:58,133 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2023-10-12 17:31:58,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 866 events. 613/866 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3132 event pairs, 32 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 1848. Up to 309 conditions per place. [2023-10-12 17:31:58,135 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 47 places, 2992 transitions, 21408 flow [2023-10-12 17:31:58,172 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 47 places, 2992 transitions, 21408 flow [2023-10-12 17:31:58,172 INFO L430 stractBuchiCegarLoop]: Abstraction has has 47 places, 2992 transitions, 21408 flow [2023-10-12 17:31:58,172 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:31:58,173 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 places, 2992 transitions, 21408 flow [2023-10-12 17:31:58,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:58,214 INFO L124 PetriNetUnfolderBase]: 182/253 cut-off events. [2023-10-12 17:31:58,214 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-10-12 17:31:58,214 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:58,215 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [108] $Ultimate##0-->L61: Formula: (and (= v_i_17 v_l_19) (= v_i_17 v_csum_13) (= v_i_17 v_p_13) (= v_i_17 v_k_22) (= v_asum_17 v_i_17) (<= 0 v_N_27) (= v_i_17 0)) InVars {csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} OutVars{csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} AuxVars[] AssignedVars[] 41#[L61]true [89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L23-1, L61-1]true [92] L61-1-->L34-1: 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] 88#[L23-1, L62, L34-1]true [107] L23-1-->L23-1: Formula: (and (< v_i_14 v_N_25) (= v_i_13 (+ v_i_14 1)) (= v_asum_13 (+ (select v_A_11 v_i_14) v_asum_14))) InVars {A=v_A_11, N=v_N_25, i=v_i_14, asum=v_asum_14} OutVars{A=v_A_11, N=v_N_25, i=v_i_13, asum=v_asum_13} AuxVars[] AssignedVars[i, asum] 88#[L23-1, L62, L34-1]true [95] L62-->L46-1: 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] 147#[L23-1, L46-1, L63, L34-1]true [104] L34-1-->thread2EXIT: Formula: (<= v_N_19 v_k_16) InVars {N=v_N_19, k=v_k_16} OutVars{N=v_N_19, k=v_k_16} AuxVars[] AssignedVars[] 149#[L23-1, L46-1, L63, thread2EXIT]true [101] L46-1-->L46-1: Formula: (and (< v_l_17 v_N_13) (<= v_p_9 v_l_17)) InVars {p=v_p_9, N=v_N_13, l=v_l_17} OutVars{p=v_p_9, N=v_N_13, l=v_l_17} AuxVars[] AssignedVars[] 149#[L23-1, L46-1, L63, thread2EXIT]true [2023-10-12 17:31:58,215 INFO L750 eck$LassoCheckResult]: Loop: 149#[L23-1, L46-1, L63, thread2EXIT]true [101] L46-1-->L46-1: Formula: (and (< v_l_17 v_N_13) (<= v_p_9 v_l_17)) InVars {p=v_p_9, N=v_N_13, l=v_l_17} OutVars{p=v_p_9, N=v_N_13, l=v_l_17} AuxVars[] AssignedVars[] 149#[L23-1, L46-1, L63, thread2EXIT]true [101] L46-1-->L46-1: Formula: (and (< v_l_17 v_N_13) (<= v_p_9 v_l_17)) InVars {p=v_p_9, N=v_N_13, l=v_l_17} OutVars{p=v_p_9, N=v_N_13, l=v_l_17} AuxVars[] AssignedVars[] 149#[L23-1, L46-1, L63, thread2EXIT]true [2023-10-12 17:31:58,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:58,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1445200703, now seen corresponding path program 1 times [2023-10-12 17:31:58,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:58,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920599036] [2023-10-12 17:31:58,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:58,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:58,261 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:31:58,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:31:58,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920599036] [2023-10-12 17:31:58,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920599036] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:31:58,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:31:58,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:31:58,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742181370] [2023-10-12 17:31:58,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:31:58,264 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:31:58,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:58,264 INFO L85 PathProgramCache]: Analyzing trace with hash 4193, now seen corresponding path program 1 times [2023-10-12 17:31:58,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:58,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103264564] [2023-10-12 17:31:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:58,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:58,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:58,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:58,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:31:58,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:31:58,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:31:58,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 2992 transitions, 21408 flow. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:58,283 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:31:58,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:31:58,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-10-12 17:31:58,700 INFO L124 PetriNetUnfolderBase]: 1164/1751 cut-off events. [2023-10-12 17:31:58,700 INFO L125 PetriNetUnfolderBase]: For 478/478 co-relation queries the response was YES. [2023-10-12 17:31:58,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7422 conditions, 1751 events. 1164/1751 cut-off events. For 478/478 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 8041 event pairs, 44 based on Foata normal form. 39/1074 useless extension candidates. Maximal degree in co-relation 4814. Up to 922 conditions per place. [2023-10-12 17:31:58,711 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 308 selfloop transitions, 20 changer transitions 86/414 dead transitions. [2023-10-12 17:31:58,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 414 transitions, 3681 flow [2023-10-12 17:31:58,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 414 transitions, 3681 flow [2023-10-12 17:31:58,815 INFO L124 PetriNetUnfolderBase]: 1164/1751 cut-off events. [2023-10-12 17:31:58,815 INFO L125 PetriNetUnfolderBase]: For 478/478 co-relation queries the response was YES. [2023-10-12 17:31:58,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7422 conditions, 1751 events. 1164/1751 cut-off events. For 478/478 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 8040 event pairs, 44 based on Foata normal form. 0/1035 useless extension candidates. Maximal degree in co-relation 4814. Up to 922 conditions per place. [2023-10-12 17:31:58,818 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 40 places, 414 transitions, 3681 flow [2023-10-12 17:31:58,822 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 40 places, 414 transitions, 3681 flow [2023-10-12 17:31:58,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:31:58,824 INFO L430 stractBuchiCegarLoop]: Abstraction has has 40 places, 414 transitions, 3681 flow [2023-10-12 17:31:58,824 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:31:58,824 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 40 places, 414 transitions, 3681 flow [2023-10-12 17:31:58,850 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:58,851 INFO L124 PetriNetUnfolderBase]: 228/339 cut-off events. [2023-10-12 17:31:58,851 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-10-12 17:31:58,851 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:58,851 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [108] $Ultimate##0-->L61: Formula: (and (= v_i_17 v_l_19) (= v_i_17 v_csum_13) (= v_i_17 v_p_13) (= v_i_17 v_k_22) (= v_asum_17 v_i_17) (<= 0 v_N_27) (= v_i_17 0)) InVars {csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} OutVars{csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} AuxVars[] AssignedVars[] 41#[L61]true [89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L23-1, L61-1]true [106] L23-1-->thread1EXIT: Formula: (<= v_N_23 v_i_11) InVars {N=v_N_23, i=v_i_11} OutVars{N=v_N_23, i=v_i_11} AuxVars[] AssignedVars[] 167#[L61-1, thread1EXIT]true [92] L61-1-->L34-1: 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] 169#[L34-1, L62, thread1EXIT]true [95] L62-->L46-1: 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] 171#[L46-1, L63, L34-1, thread1EXIT]true [2023-10-12 17:31:58,851 INFO L750 eck$LassoCheckResult]: Loop: 171#[L46-1, L63, L34-1, thread1EXIT]true [101] L46-1-->L46-1: Formula: (and (< v_l_17 v_N_13) (<= v_p_9 v_l_17)) InVars {p=v_p_9, N=v_N_13, l=v_l_17} OutVars{p=v_p_9, N=v_N_13, l=v_l_17} AuxVars[] AssignedVars[] 171#[L46-1, L63, L34-1, thread1EXIT]true [101] L46-1-->L46-1: Formula: (and (< v_l_17 v_N_13) (<= v_p_9 v_l_17)) InVars {p=v_p_9, N=v_N_13, l=v_l_17} OutVars{p=v_p_9, N=v_N_13, l=v_l_17} AuxVars[] AssignedVars[] 171#[L46-1, L63, L34-1, thread1EXIT]true [2023-10-12 17:31:58,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash 131125631, now seen corresponding path program 1 times [2023-10-12 17:31:58,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:58,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365072654] [2023-10-12 17:31:58,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:58,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:58,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:58,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:58,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:58,867 INFO L85 PathProgramCache]: Analyzing trace with hash 4193, now seen corresponding path program 2 times [2023-10-12 17:31:58,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:58,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399994987] [2023-10-12 17:31:58,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:58,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:58,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:58,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:58,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:58,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1457683039, now seen corresponding path program 1 times [2023-10-12 17:31:58,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:58,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899408016] [2023-10-12 17:31:58,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:58,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:58,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:31:58,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899408016] [2023-10-12 17:31:58,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899408016] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:31:58,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:31:58,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:31:58,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986828741] [2023-10-12 17:31:58,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:31:58,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:31:58,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:31:58,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:31:58,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 414 transitions, 3681 flow. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:58,939 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:31:58,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:31:59,150 INFO L124 PetriNetUnfolderBase]: 1500/2345 cut-off events. [2023-10-12 17:31:59,150 INFO L125 PetriNetUnfolderBase]: For 606/606 co-relation queries the response was YES. [2023-10-12 17:31:59,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12321 conditions, 2345 events. 1500/2345 cut-off events. For 606/606 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 12252 event pairs, 18 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 7969. Up to 1558 conditions per place. [2023-10-12 17:31:59,164 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 514 selfloop transitions, 87 changer transitions 199/800 dead transitions. [2023-10-12 17:31:59,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 800 transitions, 8690 flow [2023-10-12 17:31:59,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 800 transitions, 8690 flow [2023-10-12 17:31:59,340 INFO L124 PetriNetUnfolderBase]: 1500/2345 cut-off events. [2023-10-12 17:31:59,340 INFO L125 PetriNetUnfolderBase]: For 606/606 co-relation queries the response was YES. [2023-10-12 17:31:59,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12321 conditions, 2345 events. 1500/2345 cut-off events. For 606/606 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 12256 event pairs, 18 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 7969. Up to 1558 conditions per place. [2023-10-12 17:31:59,344 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 44 places, 800 transitions, 8690 flow [2023-10-12 17:31:59,354 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 44 places, 800 transitions, 8690 flow [2023-10-12 17:31:59,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:31:59,355 INFO L430 stractBuchiCegarLoop]: Abstraction has has 44 places, 800 transitions, 8690 flow [2023-10-12 17:31:59,356 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:31:59,356 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 44 places, 800 transitions, 8690 flow [2023-10-12 17:31:59,411 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:59,411 INFO L124 PetriNetUnfolderBase]: 335/494 cut-off events. [2023-10-12 17:31:59,411 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2023-10-12 17:31:59,411 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:59,412 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [108] $Ultimate##0-->L61: Formula: (and (= v_i_17 v_l_19) (= v_i_17 v_csum_13) (= v_i_17 v_p_13) (= v_i_17 v_k_22) (= v_asum_17 v_i_17) (<= 0 v_N_27) (= v_i_17 0)) InVars {csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} OutVars{csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} AuxVars[] AssignedVars[] 41#[L61]true [89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L23-1, L61-1]true [92] L61-1-->L34-1: 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] 88#[L23-1, L62, L34-1]true [107] L23-1-->L23-1: Formula: (and (< v_i_14 v_N_25) (= v_i_13 (+ v_i_14 1)) (= v_asum_13 (+ (select v_A_11 v_i_14) v_asum_14))) InVars {A=v_A_11, N=v_N_25, i=v_i_14, asum=v_asum_14} OutVars{A=v_A_11, N=v_N_25, i=v_i_13, asum=v_asum_13} AuxVars[] AssignedVars[i, asum] 88#[L23-1, L62, L34-1]true [95] L62-->L46-1: 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] 147#[L23-1, L46-1, L63, L34-1]true [2023-10-12 17:31:59,412 INFO L750 eck$LassoCheckResult]: Loop: 147#[L23-1, L46-1, L63, L34-1]true [101] L46-1-->L46-1: Formula: (and (< v_l_17 v_N_13) (<= v_p_9 v_l_17)) InVars {p=v_p_9, N=v_N_13, l=v_l_17} OutVars{p=v_p_9, N=v_N_13, l=v_l_17} AuxVars[] AssignedVars[] 147#[L23-1, L46-1, L63, L34-1]true [101] L46-1-->L46-1: Formula: (and (< v_l_17 v_N_13) (<= v_p_9 v_l_17)) InVars {p=v_p_9, N=v_N_13, l=v_l_17} OutVars{p=v_p_9, N=v_N_13, l=v_l_17} AuxVars[] AssignedVars[] 147#[L23-1, L46-1, L63, L34-1]true [2023-10-12 17:31:59,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:59,412 INFO L85 PathProgramCache]: Analyzing trace with hash 131112642, now seen corresponding path program 1 times [2023-10-12 17:31:59,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:59,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660019661] [2023-10-12 17:31:59,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:59,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:59,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:59,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:59,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:59,438 INFO L85 PathProgramCache]: Analyzing trace with hash 4193, now seen corresponding path program 3 times [2023-10-12 17:31:59,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:59,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001910364] [2023-10-12 17:31:59,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:59,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:59,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:59,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:59,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1445200610, now seen corresponding path program 1 times [2023-10-12 17:31:59,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:59,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737852928] [2023-10-12 17:31:59,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:59,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:59,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:59,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:59,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:59,634 INFO L201 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:31:59 BoogieIcfgContainer [2023-10-12 17:31:59,635 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:31:59,635 INFO L158 Benchmark]: Toolchain (without parser) took 3874.00ms. Allocated memory was 186.6MB in the beginning and 318.8MB in the end (delta: 132.1MB). Free memory was 137.6MB in the beginning and 252.7MB in the end (delta: -115.1MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. [2023-10-12 17:31:59,636 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 186.6MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:31:59,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.64ms. Allocated memory is still 186.6MB. Free memory was 137.4MB in the beginning and 136.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:31:59,641 INFO L158 Benchmark]: Boogie Preprocessor took 21.71ms. Allocated memory is still 186.6MB. Free memory was 136.0MB in the beginning and 134.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:31:59,641 INFO L158 Benchmark]: RCFGBuilder took 226.41ms. Allocated memory is still 186.6MB. Free memory was 134.8MB in the beginning and 124.6MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:31:59,641 INFO L158 Benchmark]: BuchiAutomizer took 3600.68ms. Allocated memory was 186.6MB in the beginning and 318.8MB in the end (delta: 132.1MB). Free memory was 124.5MB in the beginning and 252.7MB in the end (delta: -128.2MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. [2023-10-12 17:31:59,642 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.22ms. Allocated memory is still 186.6MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.64ms. Allocated memory is still 186.6MB. Free memory was 137.4MB in the beginning and 136.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.71ms. Allocated memory is still 186.6MB. Free memory was 136.0MB in the beginning and 134.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 226.41ms. Allocated memory is still 186.6MB. Free memory was 134.8MB in the beginning and 124.6MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3600.68ms. Allocated memory was 186.6MB in the beginning and 318.8MB in the end (delta: 132.1MB). Free memory was 124.5MB in the beginning and 252.7MB in the end (delta: -128.2MB). Peak memory consumption was 5.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 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 8690 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 240 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 334 IncrementalHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 83 mSDtfsCounter, 334 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN1 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital53 mio100 ax100 hnf100 lsp65 ukn78 mio100 lsp74 div100 bol100 ite100 ukn100 eq168 hnf91 smp100 dnf100 smp100 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms 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: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 45]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L59] 0 assume i == k && i == l && i == p && i == asum && i == csum && i == 0; [L60] 0 assume 0 <= N; VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L61] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L62] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L22] COND TRUE 1 i < N [L24] 1 asum := asum + A[i]; [L25] 1 i := i + 1; VAL [N=1, asum=0, csum=0, i=1, k=0, l=0, p=0] [L63] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, csum=0, i=1, k=0, l=0, p=0] Loop: [L45] COND TRUE l < N [L46] COND FALSE !(l < p) [L45] COND TRUE l < N [L46] COND FALSE !(l < p) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 45]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L59] 0 assume i == k && i == l && i == p && i == asum && i == csum && i == 0; [L60] 0 assume 0 <= N; VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L61] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L62] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L22] COND TRUE 1 i < N [L24] 1 asum := asum + A[i]; [L25] 1 i := i + 1; VAL [N=1, asum=0, csum=0, i=1, k=0, l=0, p=0] [L63] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, csum=0, i=1, k=0, l=0, p=0] Loop: [L45] COND TRUE l < N [L46] COND FALSE !(l < p) [L45] COND TRUE l < N [L46] COND FALSE !(l < p) End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 32 PlacesBefore, 23 PlacesAfterwards, 26 TransitionsBefore, 17 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 4 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 134, independent conditional: 0, independent unconditional: 134, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 97, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 97, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 97, unknown conditional: 0, unknown unconditional: 97] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:31:59,659 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...