/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:38:09,554 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:38:09,623 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:38:09,649 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:38:09,650 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:38:09,650 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:38:09,652 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:38:09,652 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:38:09,652 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:38:09,657 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:38:09,657 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:38:09,658 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:38:09,658 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:38:09,659 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:38:09,660 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:38:09,660 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:38:09,660 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:38:09,661 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:38:09,661 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:38:09,661 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:38:09,661 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:38:09,662 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:38:09,662 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:38:09,662 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:38:09,662 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:38:09,662 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:38:09,663 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:38:09,663 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:38:09,663 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:38:09,663 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:38:09,664 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:38:09,664 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:38:09,664 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:38:09,666 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:38:09,666 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:38:09,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:38:09,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:38:09,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:38:09,863 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:38:09,864 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:38:09,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-trans.wvr.bpl [2023-10-12 17:38:09,865 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-trans.wvr.bpl' [2023-10-12 17:38:09,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:38:09,902 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:38:09,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:09,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:38:09,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:38:09,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:09" (1/1) ... [2023-10-12 17:38:09,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:09" (1/1) ... [2023-10-12 17:38:09,934 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:38:09,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:09,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:38:09,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:38:09,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:38:09,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:09" (1/1) ... [2023-10-12 17:38:09,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:09" (1/1) ... [2023-10-12 17:38:09,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:09" (1/1) ... [2023-10-12 17:38:09,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:09" (1/1) ... [2023-10-12 17:38:09,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:09" (1/1) ... [2023-10-12 17:38:09,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:09" (1/1) ... [2023-10-12 17:38:09,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:09" (1/1) ... [2023-10-12 17:38:09,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:09" (1/1) ... [2023-10-12 17:38:09,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:38:09,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:38:09,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:38:09,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:38:09,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:09" (1/1) ... [2023-10-12 17:38:09,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:09,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:10,046 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:38:10,068 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:38:10,081 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:38:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:38:10,081 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:38:10,081 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:38:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:38:10,081 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:38:10,082 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:38:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:38:10,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:38:10,082 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:38:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:38:10,083 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:38:10,083 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:38:10,139 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:38:10,141 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:38:10,329 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:38:10,398 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:38:10,398 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-10-12 17:38:10,400 INFO L201 PluginConnector]: Adding new model nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:10 BoogieIcfgContainer [2023-10-12 17:38:10,400 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:38:10,401 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:38:10,401 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:38:10,404 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:38:10,405 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:10,405 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:09" (1/2) ... [2023-10-12 17:38:10,406 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9fb9d18 and model type nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:38:10, skipping insertion in model container [2023-10-12 17:38:10,407 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:10,407 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:10" (2/2) ... [2023-10-12 17:38:10,408 INFO L332 chiAutomizerObserver]: Analyzing ICFG nzb-file-trans.wvr.bpl [2023-10-12 17:38:10,492 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:38:10,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 86 flow [2023-10-12 17:38:10,558 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2023-10-12 17:38:10,558 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:10,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 6/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:38:10,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 86 flow [2023-10-12 17:38:10,566 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 25 transitions, 68 flow [2023-10-12 17:38:10,568 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:38:10,587 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 68 flow [2023-10-12 17:38:10,590 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 25 transitions, 68 flow [2023-10-12 17:38:10,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 68 flow [2023-10-12 17:38:10,602 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2023-10-12 17:38:10,602 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:10,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 6/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:38:10,603 INFO L119 LiptonReduction]: Number of co-enabled transitions 210 [2023-10-12 17:38:10,801 INFO L134 LiptonReduction]: Checked pairs total: 72 [2023-10-12 17:38:10,801 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:38:10,815 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:38:10,816 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:38:10,816 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:38:10,816 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:38:10,816 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:38:10,816 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:38:10,816 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:38:10,816 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:38:10,817 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 20 transitions, 58 flow [2023-10-12 17:38:10,821 ERROR L47 etriNetUnfolderRabin]: [1:1A:[157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][10], 2:2A:[141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_15) (= v_i_13_30 0) (not v_break_14_39) (not v_is_null_5_15)) InVars {is_null_1=v_is_null_1_15, is_null_5=v_is_null_5_15} OutVars{i_13=v_i_13_30, is_null_5=v_is_null_5_15, break_14=v_break_14_39, is_null_1=v_is_null_1_15} AuxVars[] AssignedVars[i_13, break_14][0]][4:3A:[144] L41-->L41: Formula: (let ((.cse2 (not v_break_14_55)) (.cse8 (select v_ends_with_6_31 v_i_13_35)) (.cse3 (not v_break_14_56)) (.cse9 (select v_ends_with_2_31 v_i_13_35))) (let ((.cse1 (not .cse9)) (.cse5 (not v_break_14_46)) (.cse0 (and .cse9 .cse3)) (.cse4 (and .cse9 .cse8)) (.cse7 (and .cse2 .cse8)) (.cse6 (not .cse8))) (and (or (and (or v_break_14_56 .cse0) v_break_14_55) (and (or v_break_14_56 .cse1) .cse2 .cse3)) (or (and (or v_break_14_46 .cse4) v_break_14_56) (and .cse5 (or .cse6 .cse1) .cse3)) .cse5 (< v_i_13_35 5) (= (+ v_i_13_35 1) v_i_13_34) (= v_result_12_39 (ite .cse7 (+ 1000 v_i_13_35) (ite .cse0 (+ v_i_13_35 (- 1000)) (ite .cse4 0 v_result_12_41)))) (or (and (or .cse7 v_break_14_55) v_break_14_43) (and (not v_break_14_43) .cse2 (or .cse6 v_break_14_55)))))) InVars {result_12=v_result_12_41, i_13=v_i_13_35, ends_with_6=v_ends_with_6_31, break_14=v_break_14_46, ends_with_2=v_ends_with_2_31} OutVars{result_12=v_result_12_39, i_13=v_i_13_34, ends_with_6=v_ends_with_6_31, break_14=v_break_14_43, ends_with_2=v_ends_with_2_31} AuxVars[v_break_14_55, v_break_14_56] AssignedVars[result_12, i_13, break_14][3]] [2023-10-12 17:38:10,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:10,824 INFO L124 PetriNetUnfolderBase]: 1/3 cut-off events. [2023-10-12 17:38:10,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:10,826 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:10,828 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:38:10,828 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 20 transitions, 58 flow [2023-10-12 17:38:10,830 ERROR L47 etriNetUnfolderRabin]: [1:1A:[157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][10], 2:2A:[141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_15) (= v_i_13_30 0) (not v_break_14_39) (not v_is_null_5_15)) InVars {is_null_1=v_is_null_1_15, is_null_5=v_is_null_5_15} OutVars{i_13=v_i_13_30, is_null_5=v_is_null_5_15, break_14=v_break_14_39, is_null_1=v_is_null_1_15} AuxVars[] AssignedVars[i_13, break_14][0]][4:3A:[144] L41-->L41: Formula: (let ((.cse2 (not v_break_14_55)) (.cse8 (select v_ends_with_6_31 v_i_13_35)) (.cse3 (not v_break_14_56)) (.cse9 (select v_ends_with_2_31 v_i_13_35))) (let ((.cse1 (not .cse9)) (.cse5 (not v_break_14_46)) (.cse0 (and .cse9 .cse3)) (.cse4 (and .cse9 .cse8)) (.cse7 (and .cse2 .cse8)) (.cse6 (not .cse8))) (and (or (and (or v_break_14_56 .cse0) v_break_14_55) (and (or v_break_14_56 .cse1) .cse2 .cse3)) (or (and (or v_break_14_46 .cse4) v_break_14_56) (and .cse5 (or .cse6 .cse1) .cse3)) .cse5 (< v_i_13_35 5) (= (+ v_i_13_35 1) v_i_13_34) (= v_result_12_39 (ite .cse7 (+ 1000 v_i_13_35) (ite .cse0 (+ v_i_13_35 (- 1000)) (ite .cse4 0 v_result_12_41)))) (or (and (or .cse7 v_break_14_55) v_break_14_43) (and (not v_break_14_43) .cse2 (or .cse6 v_break_14_55)))))) InVars {result_12=v_result_12_41, i_13=v_i_13_35, ends_with_6=v_ends_with_6_31, break_14=v_break_14_46, ends_with_2=v_ends_with_2_31} OutVars{result_12=v_result_12_39, i_13=v_i_13_34, ends_with_6=v_ends_with_6_31, break_14=v_break_14_43, ends_with_2=v_ends_with_2_31} AuxVars[v_break_14_55, v_break_14_56] AssignedVars[result_12, i_13, break_14][3]] [2023-10-12 17:38:10,830 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:10,830 INFO L124 PetriNetUnfolderBase]: 1/3 cut-off events. [2023-10-12 17:38:10,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:10,830 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:10,834 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[$Ultimate##0, L136]true [141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_15) (= v_i_13_30 0) (not v_break_14_39) (not v_is_null_5_15)) InVars {is_null_1=v_is_null_1_15, is_null_5=v_is_null_5_15} OutVars{i_13=v_i_13_30, is_null_5=v_is_null_5_15, break_14=v_break_14_39, is_null_1=v_is_null_1_15} AuxVars[] AssignedVars[i_13, break_14] 40#[L41, L136]true [2023-10-12 17:38:10,835 INFO L750 eck$LassoCheckResult]: Loop: 40#[L41, L136]true [144] L41-->L41: Formula: (let ((.cse2 (not v_break_14_55)) (.cse8 (select v_ends_with_6_31 v_i_13_35)) (.cse3 (not v_break_14_56)) (.cse9 (select v_ends_with_2_31 v_i_13_35))) (let ((.cse1 (not .cse9)) (.cse5 (not v_break_14_46)) (.cse0 (and .cse9 .cse3)) (.cse4 (and .cse9 .cse8)) (.cse7 (and .cse2 .cse8)) (.cse6 (not .cse8))) (and (or (and (or v_break_14_56 .cse0) v_break_14_55) (and (or v_break_14_56 .cse1) .cse2 .cse3)) (or (and (or v_break_14_46 .cse4) v_break_14_56) (and .cse5 (or .cse6 .cse1) .cse3)) .cse5 (< v_i_13_35 5) (= (+ v_i_13_35 1) v_i_13_34) (= v_result_12_39 (ite .cse7 (+ 1000 v_i_13_35) (ite .cse0 (+ v_i_13_35 (- 1000)) (ite .cse4 0 v_result_12_41)))) (or (and (or .cse7 v_break_14_55) v_break_14_43) (and (not v_break_14_43) .cse2 (or .cse6 v_break_14_55)))))) InVars {result_12=v_result_12_41, i_13=v_i_13_35, ends_with_6=v_ends_with_6_31, break_14=v_break_14_46, ends_with_2=v_ends_with_2_31} OutVars{result_12=v_result_12_39, i_13=v_i_13_34, ends_with_6=v_ends_with_6_31, break_14=v_break_14_43, ends_with_2=v_ends_with_2_31} AuxVars[v_break_14_55, v_break_14_56] AssignedVars[result_12, i_13, break_14] 40#[L41, L136]true [2023-10-12 17:38:10,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:10,839 INFO L85 PathProgramCache]: Analyzing trace with hash 5969, now seen corresponding path program 1 times [2023-10-12 17:38:10,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:10,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607673247] [2023-10-12 17:38:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:10,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:10,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:10,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:10,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:10,990 INFO L85 PathProgramCache]: Analyzing trace with hash 175, now seen corresponding path program 1 times [2023-10-12 17:38:10,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:10,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651545658] [2023-10-12 17:38:10,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:10,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:11,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:11,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:11,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash 185183, now seen corresponding path program 1 times [2023-10-12 17:38:11,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:11,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899384934] [2023-10-12 17:38:11,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:11,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:11,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:11,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:11,691 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:11,691 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:11,691 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:11,692 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:11,692 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:11,692 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:11,692 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:11,692 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:11,692 INFO L133 ssoRankerPreferences]: Filename of dumped script: nzb-file-trans.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:38:11,692 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:11,692 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:11,708 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:38:11,897 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:38:11,900 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:38:11,902 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:38:11,996 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2023-10-12 17:38:12,216 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:12,219 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:12,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:12,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:12,227 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:38:12,228 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:38:12,248 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:38:12,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:12,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:12,258 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:38:12,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:12,306 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:38:12,306 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:38:12,399 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:12,471 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-10-12 17:38:12,472 INFO L444 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:38:12,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:12,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:12,476 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:38:12,477 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:38:12,478 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:12,499 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2023-10-12 17:38:12,500 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:12,501 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_13) = -2*i_13 + 9 Supporting invariants [] [2023-10-12 17:38:12,511 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:38:12,513 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:12,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:12,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:12,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:12,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:12,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:12,573 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:38:12,601 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:38:12,696 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:38:12,701 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:38:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-10-12 17:38:12,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:38:12,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:12,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:12,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:12,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:38:12,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:12,706 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 100 transitions, 490 flow [2023-10-12 17:38:12,706 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:38:12,707 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 100 transitions, 490 flow [2023-10-12 17:38:12,711 ERROR L47 etriNetUnfolderRabin]: [1:1A:[157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][54], 4:2A:[160] L136-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][24], 17:3A:[146] $Ultimate##0-->L75: Formula: (and (= v_i_16_26 0) (not v_is_null_5_11) (not v_break_17_39) (not v_is_null_9_17)) InVars {is_null_5=v_is_null_5_11, is_null_9=v_is_null_9_17} OutVars{break_17=v_break_17_39, is_null_5=v_is_null_5_11, i_16=v_i_16_26, is_null_9=v_is_null_9_17} AuxVars[] AssignedVars[i_16, break_17][44]][18:4A:[149] L75-->L75: Formula: (let ((.cse1 (not v_break_17_58)) (.cse2 (not v_break_17_57)) (.cse9 (select v_ends_with_6_29 v_i_16_33)) (.cse8 (select v_ends_with_10_35 v_i_16_33))) (let ((.cse5 (not .cse8)) (.cse0 (not .cse9)) (.cse6 (not v_break_17_47)) (.cse4 (and .cse8 .cse2)) (.cse3 (and .cse1 .cse9)) (.cse7 (and .cse8 .cse9))) (and (or (and (or v_break_17_58 .cse0) .cse1 .cse2) (and (or v_break_17_58 .cse3) v_break_17_57)) (or (and v_break_17_45 (or .cse4 v_break_17_57)) (and (not v_break_17_45) (or v_break_17_57 .cse5) .cse2)) .cse6 (< v_i_16_33 5) (or (and v_break_17_58 (or .cse7 v_break_17_47)) (and (or .cse5 .cse0) .cse1 .cse6)) (= (+ v_i_16_33 1) v_i_16_32) (= v_result_15_41 (ite .cse4 (+ 1000 v_i_16_33) (ite .cse3 (+ v_i_16_33 (- 1000)) (ite .cse7 0 v_result_15_42))))))) InVars {break_17=v_break_17_47, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_29, i_16=v_i_16_33, result_15=v_result_15_42} OutVars{break_17=v_break_17_45, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_29, i_16=v_i_16_32, result_15=v_result_15_41} AuxVars[v_break_17_58, v_break_17_57] AssignedVars[i_16, result_15, break_17][34]] [2023-10-12 17:38:12,711 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:12,711 INFO L124 PetriNetUnfolderBase]: 9/17 cut-off events. [2023-10-12 17:38:12,711 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:38:12,711 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:12,712 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[$Ultimate##0, L136]true [160] L136-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 75#[$Ultimate##0, L137, $Ultimate##0]true [146] $Ultimate##0-->L75: Formula: (and (= v_i_16_26 0) (not v_is_null_5_11) (not v_break_17_39) (not v_is_null_9_17)) InVars {is_null_5=v_is_null_5_11, is_null_9=v_is_null_9_17} OutVars{break_17=v_break_17_39, is_null_5=v_is_null_5_11, i_16=v_i_16_26, is_null_9=v_is_null_9_17} AuxVars[] AssignedVars[i_16, break_17] 77#[L75, L137, $Ultimate##0]true [2023-10-12 17:38:12,712 INFO L750 eck$LassoCheckResult]: Loop: 77#[L75, L137, $Ultimate##0]true [149] L75-->L75: Formula: (let ((.cse1 (not v_break_17_58)) (.cse2 (not v_break_17_57)) (.cse9 (select v_ends_with_6_29 v_i_16_33)) (.cse8 (select v_ends_with_10_35 v_i_16_33))) (let ((.cse5 (not .cse8)) (.cse0 (not .cse9)) (.cse6 (not v_break_17_47)) (.cse4 (and .cse8 .cse2)) (.cse3 (and .cse1 .cse9)) (.cse7 (and .cse8 .cse9))) (and (or (and (or v_break_17_58 .cse0) .cse1 .cse2) (and (or v_break_17_58 .cse3) v_break_17_57)) (or (and v_break_17_45 (or .cse4 v_break_17_57)) (and (not v_break_17_45) (or v_break_17_57 .cse5) .cse2)) .cse6 (< v_i_16_33 5) (or (and v_break_17_58 (or .cse7 v_break_17_47)) (and (or .cse5 .cse0) .cse1 .cse6)) (= (+ v_i_16_33 1) v_i_16_32) (= v_result_15_41 (ite .cse4 (+ 1000 v_i_16_33) (ite .cse3 (+ v_i_16_33 (- 1000)) (ite .cse7 0 v_result_15_42))))))) InVars {break_17=v_break_17_47, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_29, i_16=v_i_16_33, result_15=v_result_15_42} OutVars{break_17=v_break_17_45, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_29, i_16=v_i_16_32, result_15=v_result_15_41} AuxVars[v_break_17_58, v_break_17_57] AssignedVars[i_16, result_15, break_17] 77#[L75, L137, $Ultimate##0]true [2023-10-12 17:38:12,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:12,712 INFO L85 PathProgramCache]: Analyzing trace with hash 185774, now seen corresponding path program 1 times [2023-10-12 17:38:12,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:12,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902762562] [2023-10-12 17:38:12,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:12,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:12,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:12,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:12,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:12,721 INFO L85 PathProgramCache]: Analyzing trace with hash 180, now seen corresponding path program 1 times [2023-10-12 17:38:12,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:12,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991974623] [2023-10-12 17:38:12,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:12,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:12,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:12,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:12,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash 5759143, now seen corresponding path program 1 times [2023-10-12 17:38:12,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:12,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104866860] [2023-10-12 17:38:12,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:12,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:12,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:12,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:12,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:13,203 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:13,204 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:13,204 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:13,204 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:13,204 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:13,204 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:13,204 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:13,204 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:13,204 INFO L133 ssoRankerPreferences]: Filename of dumped script: nzb-file-trans.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:38:13,205 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:13,205 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:13,208 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:38:13,210 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:38:13,213 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:38:13,215 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:38:13,342 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:38:13,345 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:38:13,421 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2023-10-12 17:38:13,603 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:13,603 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:13,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:13,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:13,605 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:38:13,607 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:38:13,609 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:38:13,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:13,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:13,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:13,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:13,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:13,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:13,632 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:13,640 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:38:13,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:13,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:13,642 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:38:13,652 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:38:13,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:13,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:13,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:13,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:13,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:13,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:13,664 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:38:13,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:13,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:13,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:13,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:13,800 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:38:13,801 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:38:13,803 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:38:13,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:13,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:13,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:13,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:13,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:13,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:13,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:13,817 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:38:13,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:13,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:13,818 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:38:13,825 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:38:13,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:38:13,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:13,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:13,832 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:38:13,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:13,869 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:38:13,869 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:38:13,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:14,019 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-10-12 17:38:14,019 INFO L444 ModelExtractionUtils]: 42 out of 55 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-10-12 17:38:14,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:14,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:14,025 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:38:14,030 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:38:14,031 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:14,056 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2023-10-12 17:38:14,057 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:14,057 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_16) = -2*i_16 + 9 Supporting invariants [] [2023-10-12 17:38:14,062 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:38:14,063 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:14,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:14,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:14,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:14,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:14,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:14,092 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:38:14,093 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:38:14,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:38:14,188 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:38:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-10-12 17:38:14,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:14,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:14,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:38:14,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:14,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:38:14,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:14,190 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 500 transitions, 3450 flow [2023-10-12 17:38:14,190 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:38:14,191 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 500 transitions, 3450 flow [2023-10-12 17:38:14,203 ERROR L47 etriNetUnfolderRabin]: [1:1A:[157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][272], 4:2A:[160] L136-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][122], 19:3A:[163] L137-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][247], 53:4A:[151] $Ultimate##0-->L109: Formula: (and (= v_i_19_14 0) (not v_break_20_13) (not v_is_null_1_11) (not v_is_null_9_11)) InVars {is_null_1=v_is_null_1_11, is_null_9=v_is_null_9_11} OutVars{break_20=v_break_20_13, i_19=v_i_19_14, is_null_1=v_is_null_1_11, is_null_9=v_is_null_9_11} AuxVars[] AssignedVars[break_20, i_19][147]][54:5A:[154] L109-->L109: Formula: (let ((.cse5 (not v_break_20_58)) (.cse7 (not v_break_20_57)) (.cse9 (select v_ends_with_10_31 v_i_19_33)) (.cse8 (select v_ends_with_2_29 v_i_19_33))) (let ((.cse2 (and .cse9 .cse8)) (.cse6 (not v_break_20_47)) (.cse4 (not .cse9)) (.cse0 (and .cse7 .cse9)) (.cse3 (not .cse8)) (.cse1 (and .cse5 .cse8))) (and (= (ite .cse0 (+ 1000 v_i_19_33) (ite .cse1 (+ v_i_19_33 (- 1000)) (ite .cse2 0 v_result_18_42))) v_result_18_41) (< v_i_19_33 5) (= v_i_19_32 (+ v_i_19_33 1)) (or (and (or .cse3 .cse4) .cse5 .cse6) (and (or .cse2 v_break_20_47) v_break_20_58)) .cse6 (or (and (or .cse4 v_break_20_57) .cse7 (not v_break_20_45)) (and (or .cse0 v_break_20_57) v_break_20_45)) (or (and .cse5 (or .cse3 v_break_20_58) .cse7) (and v_break_20_57 (or .cse1 v_break_20_58)))))) InVars {i_19=v_i_19_33, break_20=v_break_20_47, ends_with_10=v_ends_with_10_31, result_18=v_result_18_42, ends_with_2=v_ends_with_2_29} OutVars{i_19=v_i_19_32, break_20=v_break_20_45, ends_with_10=v_ends_with_10_31, result_18=v_result_18_41, ends_with_2=v_ends_with_2_29} AuxVars[v_break_20_58, v_break_20_57] AssignedVars[i_19, break_20, result_18][297]] [2023-10-12 17:38:14,203 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:14,203 INFO L124 PetriNetUnfolderBase]: 34/53 cut-off events. [2023-10-12 17:38:14,203 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:38:14,203 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:14,204 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[$Ultimate##0, L136]true [160] L136-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 75#[$Ultimate##0, L137, $Ultimate##0]true [163] L137-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 111#[$Ultimate##0, $Ultimate##0, L138, $Ultimate##0]true [151] $Ultimate##0-->L109: Formula: (and (= v_i_19_14 0) (not v_break_20_13) (not v_is_null_1_11) (not v_is_null_9_11)) InVars {is_null_1=v_is_null_1_11, is_null_9=v_is_null_9_11} OutVars{break_20=v_break_20_13, i_19=v_i_19_14, is_null_1=v_is_null_1_11, is_null_9=v_is_null_9_11} AuxVars[] AssignedVars[break_20, i_19] 113#[$Ultimate##0, $Ultimate##0, L138, L109]true [2023-10-12 17:38:14,204 INFO L750 eck$LassoCheckResult]: Loop: 113#[$Ultimate##0, $Ultimate##0, L138, L109]true [154] L109-->L109: Formula: (let ((.cse5 (not v_break_20_58)) (.cse7 (not v_break_20_57)) (.cse9 (select v_ends_with_10_31 v_i_19_33)) (.cse8 (select v_ends_with_2_29 v_i_19_33))) (let ((.cse2 (and .cse9 .cse8)) (.cse6 (not v_break_20_47)) (.cse4 (not .cse9)) (.cse0 (and .cse7 .cse9)) (.cse3 (not .cse8)) (.cse1 (and .cse5 .cse8))) (and (= (ite .cse0 (+ 1000 v_i_19_33) (ite .cse1 (+ v_i_19_33 (- 1000)) (ite .cse2 0 v_result_18_42))) v_result_18_41) (< v_i_19_33 5) (= v_i_19_32 (+ v_i_19_33 1)) (or (and (or .cse3 .cse4) .cse5 .cse6) (and (or .cse2 v_break_20_47) v_break_20_58)) .cse6 (or (and (or .cse4 v_break_20_57) .cse7 (not v_break_20_45)) (and (or .cse0 v_break_20_57) v_break_20_45)) (or (and .cse5 (or .cse3 v_break_20_58) .cse7) (and v_break_20_57 (or .cse1 v_break_20_58)))))) InVars {i_19=v_i_19_33, break_20=v_break_20_47, ends_with_10=v_ends_with_10_31, result_18=v_result_18_42, ends_with_2=v_ends_with_2_29} OutVars{i_19=v_i_19_32, break_20=v_break_20_45, ends_with_10=v_ends_with_10_31, result_18=v_result_18_41, ends_with_2=v_ends_with_2_29} AuxVars[v_break_20_58, v_break_20_57] AssignedVars[i_19, break_20, result_18] 113#[$Ultimate##0, $Ultimate##0, L138, L109]true [2023-10-12 17:38:14,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:14,204 INFO L85 PathProgramCache]: Analyzing trace with hash 5759672, now seen corresponding path program 1 times [2023-10-12 17:38:14,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:14,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810781545] [2023-10-12 17:38:14,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:14,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:14,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:14,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:14,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:14,213 INFO L85 PathProgramCache]: Analyzing trace with hash 185, now seen corresponding path program 1 times [2023-10-12 17:38:14,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:14,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956525271] [2023-10-12 17:38:14,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:14,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:14,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:14,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:14,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:14,224 INFO L85 PathProgramCache]: Analyzing trace with hash 178549986, now seen corresponding path program 1 times [2023-10-12 17:38:14,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:14,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590991568] [2023-10-12 17:38:14,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:14,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:14,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:14,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:14,622 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:14,622 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:14,623 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:14,623 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:14,623 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:14,623 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:14,623 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:14,623 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:14,623 INFO L133 ssoRankerPreferences]: Filename of dumped script: nzb-file-trans.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:38:14,623 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:14,623 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:14,626 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:38:14,628 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:38:14,767 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:38:14,770 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:38:14,772 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:38:14,774 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:38:14,778 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:38:14,781 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:38:14,783 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:38:14,891 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2023-10-12 17:38:15,084 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:15,084 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:15,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:15,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:15,086 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:38:15,093 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:38:15,094 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:38:15,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:15,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:15,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:15,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:15,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:15,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:15,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:15,129 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:38:15,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:15,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:15,131 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:38:15,137 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:38:15,173 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:38:15,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:15,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:15,181 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:38:15,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:15,216 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:38:15,217 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:38:15,298 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:15,345 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-10-12 17:38:15,345 INFO L444 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:38:15,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:15,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:15,347 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:38:15,349 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:38:15,350 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:15,360 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2023-10-12 17:38:15,361 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:15,361 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_19) = -2*i_19 + 9 Supporting invariants [] [2023-10-12 17:38:15,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:15,372 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:15,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:15,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:15,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:15,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:15,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:15,399 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:38:15,400 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:38:15,478 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:38:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:15,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-10-12 17:38:15,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:38:15,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:15,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:38:15,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:15,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:38:15,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:15,481 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 2500 transitions, 22250 flow [2023-10-12 17:38:15,481 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:38:15,481 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 39 places, 2500 transitions, 22250 flow [2023-10-12 17:38:15,650 INFO L124 PetriNetUnfolderBase]: 448/667 cut-off events. [2023-10-12 17:38:15,650 INFO L125 PetriNetUnfolderBase]: For 175/175 co-relation queries the response was YES. [2023-10-12 17:38:15,650 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:38:15,655 INFO L201 PluginConnector]: Adding new model nzb-file-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:38:15 BoogieIcfgContainer [2023-10-12 17:38:15,655 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:38:15,656 INFO L158 Benchmark]: Toolchain (without parser) took 5753.86ms. Allocated memory was 174.1MB in the beginning and 234.9MB in the end (delta: 60.8MB). Free memory was 128.1MB in the beginning and 84.4MB in the end (delta: 43.7MB). Peak memory consumption was 105.2MB. Max. memory is 8.0GB. [2023-10-12 17:38:15,656 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 174.1MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:38:15,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.28ms. Allocated memory is still 174.1MB. Free memory was 127.9MB in the beginning and 126.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:15,657 INFO L158 Benchmark]: Boogie Preprocessor took 31.70ms. Allocated memory is still 174.1MB. Free memory was 126.3MB in the beginning and 125.2MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:15,657 INFO L158 Benchmark]: RCFGBuilder took 431.53ms. Allocated memory is still 174.1MB. Free memory was 125.1MB in the beginning and 106.4MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-10-12 17:38:15,658 INFO L158 Benchmark]: BuchiAutomizer took 5253.99ms. Allocated memory was 174.1MB in the beginning and 234.9MB in the end (delta: 60.8MB). Free memory was 106.2MB in the beginning and 84.4MB in the end (delta: 21.8MB). Peak memory consumption was 84.2MB. Max. memory is 8.0GB. [2023-10-12 17:38:15,659 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.26ms. Allocated memory is still 174.1MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.28ms. Allocated memory is still 174.1MB. Free memory was 127.9MB in the beginning and 126.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.70ms. Allocated memory is still 174.1MB. Free memory was 126.3MB in the beginning and 125.2MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 431.53ms. Allocated memory is still 174.1MB. Free memory was 125.1MB in the beginning and 106.4MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 5253.99ms. Allocated memory was 174.1MB in the beginning and 234.9MB in the end (delta: 60.8MB). Free memory was 106.2MB in the beginning and 84.4MB in the end (delta: 21.8MB). Peak memory consumption was 84.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i_13 + 9 and consists of 4 locations. One deterministic module has affine ranking function 9 + -2 * i_16 and consists of 4 locations. One deterministic module has affine ranking function -2 * i_19 + 9 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 4.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 225 IncrementalHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 72 mSDtfsCounter, 225 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital95 mio100 ax100 hnf100 lsp485 ukn16 mio100 lsp100 div100 bol132 ite100 ukn100 eq145 hnf98 smp100 dnf471 smp22 tf100 neg100 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 280ms VariablesStem: 2 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 29 PlacesBefore, 24 PlacesAfterwards, 25 TransitionsBefore, 20 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 72, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 72, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 72, unknown conditional: 0, unknown unconditional: 72] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:38:15,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:15,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...