/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:19:33,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:19:33,774 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:19:33,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:19:33,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:19:33,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:19:33,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:19:33,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:19:33,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:19:33,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:19:33,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:19:33,828 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:19:33,828 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:19:33,829 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:19:33,829 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:19:33,830 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:19:33,830 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:19:33,830 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:19:33,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:19:33,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:19:33,831 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:19:33,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:19:33,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:19:33,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:19:33,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:19:33,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:19:33,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:19:33,833 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:19:33,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:19:33,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:19:33,834 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:19:33,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:19:33,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:19:33,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:19:33,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:19:33,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:19:33,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:19:33,835 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:19:33,835 INFO L153 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:19:34,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:19:34,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:19:34,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:19:34,153 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-10 01:19:34,154 INFO L274 PluginConnector]: CDTParser initialized [2024-02-10 01:19:34,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2024-02-10 01:19:35,845 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-10 01:19:36,346 INFO L384 CDTParser]: Found 1 translation units. [2024-02-10 01:19:36,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2024-02-10 01:19:36,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddcdf87d2/a03ed97f1c0040c882234ced705aa881/FLAG4d30d1f5f [2024-02-10 01:19:36,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddcdf87d2/a03ed97f1c0040c882234ced705aa881 [2024-02-10 01:19:36,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:19:36,545 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-10 01:19:36,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-10 01:19:36,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-10 01:19:36,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-10 01:19:36,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 01:19:36" (1/1) ... [2024-02-10 01:19:36,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702f9554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:19:36, skipping insertion in model container [2024-02-10 01:19:36,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 01:19:36" (1/1) ... [2024-02-10 01:19:36,639 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-10 01:19:36,896 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 01:19:36,911 INFO L202 MainTranslator]: Completed pre-run [2024-02-10 01:19:36,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 01:19:36,954 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 01:19:36,954 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 01:19:36,970 INFO L206 MainTranslator]: Completed translation [2024-02-10 01:19:36,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:19:36 WrapperNode [2024-02-10 01:19:36,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-10 01:19:36,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:19:36,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:19:36,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:19:36,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:19:36" (1/1) ... [2024-02-10 01:19:36,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:19:36" (1/1) ... [2024-02-10 01:19:37,029 INFO L138 Inliner]: procedures = 21, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 78 [2024-02-10 01:19:37,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:19:37,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:19:37,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:19:37,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:19:37,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:19:36" (1/1) ... [2024-02-10 01:19:37,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:19:36" (1/1) ... [2024-02-10 01:19:37,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:19:36" (1/1) ... [2024-02-10 01:19:37,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:19:36" (1/1) ... [2024-02-10 01:19:37,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:19:36" (1/1) ... [2024-02-10 01:19:37,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:19:36" (1/1) ... [2024-02-10 01:19:37,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:19:36" (1/1) ... [2024-02-10 01:19:37,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:19:36" (1/1) ... [2024-02-10 01:19:37,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:19:37,080 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:19:37,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:19:37,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:19:37,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:19:36" (1/1) ... [2024-02-10 01:19:37,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:37,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:19:37,185 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) [2024-02-10 01:19:37,264 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 [2024-02-10 01:19:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-10 01:19:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 01:19:37,377 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 01:19:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 01:19:37,377 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 01:19:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-10 01:19:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-10 01:19:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-10 01:19:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-10 01:19:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-10 01:19:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:19:37,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:19:37,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-10 01:19:37,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-10 01:19:37,387 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:19:37,486 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:19:37,488 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:19:37,661 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:19:37,689 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:19:37,689 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-10 01:19:37,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:19:37 BoogieIcfgContainer [2024-02-10 01:19:37,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:19:37,692 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:19:37,692 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:19:37,695 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:19:37,696 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:19:37,696 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.02 01:19:36" (1/3) ... [2024-02-10 01:19:37,697 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@461b4f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:19:37, skipping insertion in model container [2024-02-10 01:19:37,697 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:19:37,697 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:19:36" (2/3) ... [2024-02-10 01:19:37,697 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@461b4f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:19:37, skipping insertion in model container [2024-02-10 01:19:37,697 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:19:37,697 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:19:37" (3/3) ... [2024-02-10 01:19:37,698 INFO L332 chiAutomizerObserver]: Analyzing ICFG popl20-figure1-alt.wvr.c [2024-02-10 01:19:37,758 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 01:19:37,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 91 transitions, 196 flow [2024-02-10 01:19:37,837 INFO L124 PetriNetUnfolderBase]: 6/87 cut-off events. [2024-02-10 01:19:37,837 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:19:37,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 87 events. 6/87 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-02-10 01:19:37,841 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 91 transitions, 196 flow [2024-02-10 01:19:37,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 87 transitions, 186 flow [2024-02-10 01:19:37,883 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:19:37,883 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:19:37,883 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:19:37,884 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:19:37,884 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:19:37,888 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:19:37,888 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:19:37,888 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:19:37,888 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:19:37,889 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 88 places, 87 transitions, 186 flow [2024-02-10 01:19:37,983 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 541 states, 540 states have (on average 2.6333333333333333) internal successors, (1422), 540 states have internal predecessors, (1422), 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) [2024-02-10 01:19:37,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 541 states, 540 states have (on average 2.6333333333333333) internal successors, (1422), 540 states have internal predecessors, (1422), 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) [2024-02-10 01:19:38,067 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 345 [2024-02-10 01:19:38,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:19:38,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:19:38,072 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:19:38,072 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:19:38,072 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 88 places, 87 transitions, 186 flow [2024-02-10 01:19:38,107 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 541 states, 540 states have (on average 2.6333333333333333) internal successors, (1422), 540 states have internal predecessors, (1422), 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) [2024-02-10 01:19:38,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 541 states, 540 states have (on average 2.6333333333333333) internal successors, (1422), 540 states have internal predecessors, (1422), 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) [2024-02-10 01:19:38,114 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 345 [2024-02-10 01:19:38,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:19:38,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:19:38,143 INFO L748 eck$LassoCheckResult]: Stem: Black: 1177#[$Ultimate##0]don't care [183] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 1180#[L-1]don't care [188] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 1182#[L21]don't care [182] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 1184#[L21-1]don't care [200] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 1186#[L21-2]don't care [198] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 1188#[L21-3]don't care [167] L21-3-->L21-4: Formula: (and (= (select |v_#length_2| 2) 25) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 1190#[L21-4]don't care [223] L21-4-->L38: Formula: (= 0 v_~N1~0_3) InVars {} OutVars{~N1~0=v_~N1~0_3} AuxVars[] AssignedVars[~N1~0] 1192#[L38]don't care [224] L38-->L38-1: Formula: (= 0 v_~N2~0_3) InVars {} OutVars{~N2~0=v_~N2~0_3} AuxVars[] AssignedVars[~N2~0] 1194#[L38-1]don't care [168] L38-1-->L-1-1: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] 1196#[L-1-1]don't care [209] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 1198#[L-1-2]don't care [213] L-1-2-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 1200#[L62]don't care [217] L62-->L62-1: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_3| 1) |v_#valid_4|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_3| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 1202#[L62-1]don't care [203] L62-1-->L62-2: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_3| 0)) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_3| 1) |v_#valid_6|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| 4)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 1204#[L62-2]don't care [181] L62-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 1206#[L64]don't care [169] L64-->L64-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_4| v_~N1~0_4) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|, ~N1~0=v_~N1~0_4} AuxVars[] AssignedVars[~N1~0] 1208#[L64-1]don't care [211] L64-1-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 1210#[L65]don't care [229] L65-->L65-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 1212#[L65-1]don't care [206] L65-1-->L65-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_4| v_~N2~0_4) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|, ~N2~0=v_~N2~0_4} AuxVars[] AssignedVars[~N2~0] 1214#[L65-2]don't care [187] L65-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 1216#[L67]don't care [204] L67-->L67-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~N1~0_5) (<= 0 v_~N2~0_5)) 1 0)) InVars {~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5} OutVars{~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1218#[L67-1]don't care [174] L67-1-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1220#[L34]don't care [177] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1222#[L35]don't care [202] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 1226#[L34-1]don't care [196] L34-1-->L67-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1228#[L67-2]don't care [161] L67-2-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1230#[L70]don't care [227] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_3| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] 1232#[L70-1]don't care [178] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 1234#[L70-2]don't care [176] L70-2-->L70-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_4|) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_4| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4| |v_ULTIMATE.start_main_#t~pre7#1_4|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|))) InVars {#valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[#memory_int] 1236#[L70-3]don't care [258] L70-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_7| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 1238#[L70-4, $Ultimate##0]don't care [231] $Ultimate##0-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 1240#[L70-4, L41-4]don't care [2024-02-10 01:19:38,144 INFO L750 eck$LassoCheckResult]: Loop: 1240#[L70-4, L41-4]don't care [232] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N1~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N1~0=v_~N1~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[] 1244#[L70-4, L42]don't care [235] L42-->L44: Formula: (= (+ v_~counter~0_13 1) v_~counter~0_12) InVars {~counter~0=v_~counter~0_13} OutVars{~counter~0=v_~counter~0_12, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post2] 1252#[L70-4, L44]don't care [237] L44-->L41-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 1264#[L41-2, L70-4]don't care [239] L41-2-->L41-3: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 1280#[L41-3, L70-4]don't care [241] L41-3-->L41-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 1240#[L70-4, L41-4]don't care [2024-02-10 01:19:38,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:19:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash -528151017, now seen corresponding path program 1 times [2024-02-10 01:19:38,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:19:38,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491568483] [2024-02-10 01:19:38,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:19:38,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:19:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:19:38,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:19:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:19:38,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:19:38,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:19:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash 250122315, now seen corresponding path program 1 times [2024-02-10 01:19:38,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:19:38,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029798980] [2024-02-10 01:19:38,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:19:38,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:19:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:19:38,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:19:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:19:38,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:19:38,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:19:38,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1025056779, now seen corresponding path program 1 times [2024-02-10 01:19:38,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:19:38,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059054600] [2024-02-10 01:19:38,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:19:38,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:19:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:19:38,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:19:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:19:38,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:19:38,759 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:19:38,773 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:19:38,774 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:19:38,774 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:19:38,774 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 01:19:38,774 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:38,774 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:19:38,774 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:19:38,774 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration1_Loop [2024-02-10 01:19:38,775 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:19:38,775 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:19:38,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:38,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:38,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:38,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:38,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:38,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:38,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:38,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:39,006 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:19:39,006 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 01:19:39,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:39,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:19:39,124 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) [2024-02-10 01:19:39,126 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 [2024-02-10 01:19:39,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:19:39,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:19:39,153 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 01:19:39,153 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_1=1} Honda state: {v_rep#funAddr~thread2.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 01:19:39,160 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 [2024-02-10 01:19:39,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:39,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:19:39,162 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) [2024-02-10 01:19:39,163 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 [2024-02-10 01:19:39,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:19:39,166 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:19:39,190 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 01:19:39,191 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_1=-1} Honda state: {v_rep#funAddr~thread1.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 01:19:39,196 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 [2024-02-10 01:19:39,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:39,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:19:39,205 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) [2024-02-10 01:19:39,206 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 [2024-02-10 01:19:39,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:19:39,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:19:39,230 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 [2024-02-10 01:19:39,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:39,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:19:39,233 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) [2024-02-10 01:19:39,264 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 01:19:39,265 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:19:39,288 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 [2024-02-10 01:19:39,388 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 01:19:39,395 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 [2024-02-10 01:19:39,396 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:19:39,396 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:19:39,396 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:19:39,396 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:19:39,396 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:19:39,396 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:39,396 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:19:39,396 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:19:39,397 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration1_Loop [2024-02-10 01:19:39,397 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:19:39,397 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:19:39,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:39,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:39,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:39,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:39,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:39,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:39,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:39,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:39,490 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:19:39,495 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:19:39,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:39,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:19:39,497 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) [2024-02-10 01:19:39,519 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 [2024-02-10 01:19:39,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:19:39,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:19:39,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:19:39,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:19:39,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:19:39,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:19:39,536 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 [2024-02-10 01:19:39,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:19:39,554 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 [2024-02-10 01:19:39,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:39,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:19:39,556 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) [2024-02-10 01:19:39,562 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 [2024-02-10 01:19:39,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:19:39,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:19:39,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:19:39,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:19:39,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:19:39,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:19:39,578 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 [2024-02-10 01:19:39,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:19:39,592 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 [2024-02-10 01:19:39,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:39,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:19:39,594 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) [2024-02-10 01:19:39,599 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 [2024-02-10 01:19:39,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:19:39,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:19:39,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:19:39,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:19:39,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:19:39,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:19:39,622 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 [2024-02-10 01:19:39,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:19:39,635 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 [2024-02-10 01:19:39,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:39,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:19:39,637 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) [2024-02-10 01:19:39,643 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 [2024-02-10 01:19:39,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:19:39,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:19:39,652 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 [2024-02-10 01:19:39,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:19:39,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:19:39,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:19:39,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:19:39,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:19:39,669 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:19:39,674 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:19:39,674 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:19:39,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:39,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:19:39,679 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) [2024-02-10 01:19:39,685 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:19:39,685 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 01:19:39,685 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:19:39,686 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0, ~N1~0) = -1*thread1Thread1of1ForFork1_~i~0 + 1*~N1~0 Supporting invariants [] [2024-02-10 01:19:39,692 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 [2024-02-10 01:19:39,708 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 [2024-02-10 01:19:39,711 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:19:39,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:19:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:19:39,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:19:39,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:19:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:19:39,828 WARN L260 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:19:39,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:19:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:19:39,933 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-10 01:19:39,934 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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) [2024-02-10 01:19:40,144 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 13 states and 1616 transitions.8 powerset states5 rank states. The highest rank that occured is 1 [2024-02-10 01:19:40,148 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:19:40,149 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:19:40,165 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:19:40,165 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:19:40,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-02-10 01:19:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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) [2024-02-10 01:19:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 611 transitions. [2024-02-10 01:19:40,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 611 transitions. Stem has 30 letters. Loop has 5 letters. [2024-02-10 01:19:40,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:19:40,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 611 transitions. Stem has 35 letters. Loop has 5 letters. [2024-02-10 01:19:40,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:19:40,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 611 transitions. Stem has 30 letters. Loop has 10 letters. [2024-02-10 01:19:40,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:19:40,174 INFO L428 stractBuchiCegarLoop]: Abstraction has has 114 places, 3080 transitions, 12722 flow [2024-02-10 01:19:40,174 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:19:40,174 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:19:40,174 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 114 places, 3080 transitions, 12722 flow [2024-02-10 01:19:40,406 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 2032 states, 2021 states have (on average 3.0801583374567048) internal successors, (6225), 2031 states have internal predecessors, (6225), 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) [2024-02-10 01:19:40,409 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 [2024-02-10 01:19:40,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2032 states, 2021 states have (on average 3.0801583374567048) internal successors, (6225), 2031 states have internal predecessors, (6225), 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) [2024-02-10 01:19:40,434 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 430 [2024-02-10 01:19:40,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:19:40,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:19:40,437 INFO L748 eck$LassoCheckResult]: Stem: Black: 2412#[$Ultimate##0]don't care [183] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] Black: 2415#[L-1]don't care [188] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] Black: 2420#[L21]don't care [182] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] Black: 2428#[L21-1]don't care [200] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] Black: 2436#[L21-2]don't care [198] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] Black: 2444#[L21-3]don't care [167] L21-3-->L21-4: Formula: (and (= (select |v_#length_2| 2) 25) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 2455#[L21-4]don't care [223] L21-4-->L38: Formula: (= 0 v_~N1~0_3) InVars {} OutVars{~N1~0=v_~N1~0_3} AuxVars[] AssignedVars[~N1~0] Black: 2465#[L38]don't care [224] L38-->L38-1: Formula: (= 0 v_~N2~0_3) InVars {} OutVars{~N2~0=v_~N2~0_3} AuxVars[] AssignedVars[~N2~0] 2471#[L38-1]don't care [168] L38-1-->L-1-1: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] Black: 2481#[L-1-1]don't care [209] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 2487#[L-1-2]don't care [213] L-1-2-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] Black: 2497#[L62]don't care [217] L62-->L62-1: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_3| 1) |v_#valid_4|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_3| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 2503#[L62-1]don't care [203] L62-1-->L62-2: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_3| 0)) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_3| 1) |v_#valid_6|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| 4)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] Black: 2513#[L62-2]don't care [181] L62-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 2519#[L64]don't care [169] L64-->L64-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_4| v_~N1~0_4) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|, ~N1~0=v_~N1~0_4} AuxVars[] AssignedVars[~N1~0] Black: 2529#[L64-1]don't care [211] L64-1-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 2535#[L65]don't care [229] L65-->L65-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] Black: 2545#[L65-1]don't care [206] L65-1-->L65-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_4| v_~N2~0_4) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|, ~N2~0=v_~N2~0_4} AuxVars[] AssignedVars[~N2~0] 2551#[L65-2]don't care [187] L65-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] Black: 2561#[L67]don't care [204] L67-->L67-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~N1~0_5) (<= 0 v_~N2~0_5)) 1 0)) InVars {~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5} OutVars{~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2567#[L67-1]don't care [174] L67-1-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] Black: 2577#[L34]don't care [177] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 2583#[L35]don't care [202] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] Black: 2601#[L34-1]don't care [196] L34-1-->L67-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 2610#[L67-2]don't care [161] L67-2-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] Black: 2623#[L70]don't care [227] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_3| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] 2632#[L70-1]don't care [178] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] Black: 2645#[L70-2]don't care [176] L70-2-->L70-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_4|) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_4| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4| |v_ULTIMATE.start_main_#t~pre7#1_4|)) |v_#memory_int_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|))) InVars {#valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[#memory_int] 2654#[L70-3]don't care [258] L70-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_7| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] Black: 2667#[$Ultimate##0, L70-4]don't care [163] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] 2676#[L70-5, $Ultimate##0]don't care [205] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] Black: 2698#[$Ultimate##0, L71]don't care [151] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] 2731#[L71-1, $Ultimate##0]don't care [172] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] Black: 2799#[$Ultimate##0, L71-2]don't care [212] L71-2-->L71-3: Formula: (and (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_4| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4| |v_ULTIMATE.start_main_#t~pre9#1_4|)) |v_#memory_int_5|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|))) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[#memory_int] 2877#[$Ultimate##0, L71-3]don't care [255] L71-3-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_14|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_8|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] Black: 2978#[$Ultimate##0, $Ultimate##0, L71-4]don't care [242] $Ultimate##0-->L51-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 3087#[$Ultimate##0, L51-4, L71-4]don't care [2024-02-10 01:19:40,437 INFO L750 eck$LassoCheckResult]: Loop: 3087#[$Ultimate##0, L51-4, L71-4]don't care [243] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~N2~0_2) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N2~0=v_~N2~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N2~0=v_~N2~0_2} AuxVars[] AssignedVars[] Black: 3241#[$Ultimate##0, L52, L71-4]don't care [246] L52-->L55: Formula: (and (not (= (ite (< 0 v_~counter~0_35) 1 0) 0)) (= (+ v_~counter~0_34 1) v_~counter~0_35)) InVars {~counter~0=v_~counter~0_35} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~counter~0=v_~counter~0_34, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4#1] 3427#[$Ultimate##0, L55, L71-4]don't care [248] L55-->L51-2: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_9| |v_thread2Thread1of1ForFork0_#t~post3#1_1|) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3#1] Black: 3738#[$Ultimate##0, L51-2, L71-4]don't care [250] L51-2-->L51-3: Formula: (= (+ |v_thread2Thread1of1ForFork0_#t~post3#1_3| 1) |v_thread2Thread1of1ForFork0_~i~1#1_11|) InVars {thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_3|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_11|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 4160#[$Ultimate##0, L71-4, L51-3]don't care [252] L51-3-->L51-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3#1] Black: 3095#[$Ultimate##0, L51-4, L71-4]don't care [243] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~N2~0_2) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N2~0=v_~N2~0_2} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N2~0=v_~N2~0_2} AuxVars[] AssignedVars[] 3228#[$Ultimate##0, L52, L71-4]don't care [246] L52-->L55: Formula: (and (not (= (ite (< 0 v_~counter~0_35) 1 0) 0)) (= (+ v_~counter~0_34 1) v_~counter~0_35)) InVars {~counter~0=v_~counter~0_35} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~counter~0=v_~counter~0_34, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4#1] Black: 3432#[$Ultimate##0, L55, L71-4]don't care [248] L55-->L51-2: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_9| |v_thread2Thread1of1ForFork0_#t~post3#1_1|) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3#1] 3733#[$Ultimate##0, L51-2, L71-4]don't care [250] L51-2-->L51-3: Formula: (= (+ |v_thread2Thread1of1ForFork0_#t~post3#1_3| 1) |v_thread2Thread1of1ForFork0_~i~1#1_11|) InVars {thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_3|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_11|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] Black: 4165#[$Ultimate##0, L71-4, L51-3]don't care [252] L51-3-->L51-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3#1] 3087#[$Ultimate##0, L51-4, L71-4]don't care [2024-02-10 01:19:40,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:19:40,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1509745528, now seen corresponding path program 1 times [2024-02-10 01:19:40,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:19:40,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115761871] [2024-02-10 01:19:40,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:19:40,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:19:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:19:40,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:19:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:19:40,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:19:40,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:19:40,482 INFO L85 PathProgramCache]: Analyzing trace with hash -147835615, now seen corresponding path program 1 times [2024-02-10 01:19:40,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:19:40,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638173779] [2024-02-10 01:19:40,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:19:40,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:19:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:19:40,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:19:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:19:40,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:19:40,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:19:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash 117207000, now seen corresponding path program 1 times [2024-02-10 01:19:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:19:40,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812996168] [2024-02-10 01:19:40,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:19:40,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:19:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:19:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-10 01:19:40,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 01:19:40,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812996168] [2024-02-10 01:19:40,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812996168] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 01:19:40,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 01:19:40,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-10 01:19:40,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333542157] [2024-02-10 01:19:40,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 01:19:40,646 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:19:40,646 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:19:40,646 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:19:40,646 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:19:40,646 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 01:19:40,646 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:40,646 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:19:40,646 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:19:40,646 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration2_Loop [2024-02-10 01:19:40,647 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:19:40,647 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:19:40,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:40,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:40,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:40,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:40,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:40,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:40,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:40,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:40,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:40,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:40,727 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:19:40,728 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 01:19:40,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:40,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:19:40,729 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) [2024-02-10 01:19:40,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:19:40,734 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:19:40,756 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 [2024-02-10 01:19:40,779 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 [2024-02-10 01:19:40,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:40,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:19:40,782 INFO L229 MonitoredProcess]: Starting monitored process 12 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) [2024-02-10 01:19:40,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 01:19:40,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 01:19:40,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:19:41,095 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 01:19:41,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-02-10 01:19:41,103 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:19:41,103 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:19:41,103 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:19:41,103 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:19:41,103 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:19:41,103 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:41,104 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:19:41,104 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:19:41,104 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1-alt.wvr.c_BEv2_Iteration2_Loop [2024-02-10 01:19:41,104 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:19:41,104 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:19:41,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:41,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:41,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:41,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:41,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:41,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:41,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:41,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:41,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:41,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:19:41,292 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:19:41,292 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:19:41,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:41,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:19:41,294 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2024-02-10 01:19:41,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 01:19:41,315 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 [2024-02-10 01:19:41,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:19:41,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:19:41,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:19:41,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:19:41,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:19:41,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:19:41,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:19:41,340 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:19:41,363 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:19:41,363 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:19:41,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:19:41,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:19:41,381 INFO L229 MonitoredProcess]: Starting monitored process 14 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) [2024-02-10 01:19:41,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 01:19:41,397 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:19:41,398 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 01:19:41,398 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:19:41,398 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N2~0, thread2Thread1of1ForFork0_~i~1#1) = 1*~N2~0 - 1*thread2Thread1of1ForFork0_~i~1#1 Supporting invariants [] [2024-02-10 01:19:41,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 01:19:41,421 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:19:41,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:19:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:19:41,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:19:41,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:19:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:19:41,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-10 01:19:41,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:19:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:19:41,610 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2024-02-10 01:19:41,610 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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) [2024-02-10 01:19:41,822 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 15 states and 1879 transitions.9 powerset states6 rank states. The highest rank that occured is 1 [2024-02-10 01:19:41,823 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:19:41,823 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:19:42,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 01:19:42,896 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:19:42,896 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:19:42,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2024-02-10 01:19:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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) [2024-02-10 01:19:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 699 transitions. [2024-02-10 01:19:42,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 699 transitions. Stem has 36 letters. Loop has 10 letters. [2024-02-10 01:19:42,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:19:42,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 699 transitions. Stem has 46 letters. Loop has 10 letters. [2024-02-10 01:19:42,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:19:42,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 699 transitions. Stem has 36 letters. Loop has 20 letters. [2024-02-10 01:19:42,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:19:42,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 01:19:42,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-10 01:19:42,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-10 01:19:43,128 INFO L175 Difference]: Start difference. First operand has 144 places, 129032 transitions, 789372 flow. Second operand 3 states and 273 transitions. [2024-02-10 01:19:43,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 129032 transitions, 789372 flow. Second operand 3 states and 273 transitions. [2024-02-10 01:19:43,130 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 91 [2024-02-10 01:19:43,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 01:20:10,533 INFO L124 PetriNetUnfolderBase]: 15093/20511 cut-off events. [2024-02-10 01:20:10,533 INFO L125 PetriNetUnfolderBase]: For 1171/1171 co-relation queries the response was YES. [2024-02-10 01:20:10,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63951 conditions, 20511 events. 15093/20511 cut-off events. For 1171/1171 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 94813 event pairs, 0 based on Foata normal form. 623/11652 useless extension candidates. Maximal degree in co-relation 59255. Up to 3581 conditions per place. [2024-02-10 01:20:10,693 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 168 selfloop transitions, 56 changer transitions 26/3417 dead transitions. [2024-02-10 01:20:10,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 3417 transitions, 21352 flow [2024-02-10 01:20:10,709 INFO L231 Difference]: Finished difference. Result has 147 places, 3391 transitions, 21084 flow [2024-02-10 01:20:10,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-10 01:20:10,711 INFO L428 stractBuchiCegarLoop]: Abstraction has has 147 places, 3391 transitions, 21084 flow [2024-02-10 01:20:10,711 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:20:10,711 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:20:10,711 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 147 places, 3391 transitions, 21084 flow [2024-02-10 01:20:12,104 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 5399 states, 5294 states have (on average 3.8672081601813373) internal successors, (20473), 5398 states have internal predecessors, (20473), 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) [2024-02-10 01:20:12,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5399 states, 5294 states have (on average 3.8672081601813373) internal successors, (20473), 5398 states have internal predecessors, (20473), 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) [2024-02-10 01:20:12,195 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 01:20:12,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 01:20:12,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:20:12 BoogieIcfgContainer [2024-02-10 01:20:12,206 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:20:12,207 INFO L158 Benchmark]: Toolchain (without parser) took 35661.60ms. Allocated memory was 172.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 103.5MB in the beginning and 967.2MB in the end (delta: -863.7MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-02-10 01:20:12,207 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 172.0MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:20:12,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.40ms. Allocated memory was 172.0MB in the beginning and 247.5MB in the end (delta: 75.5MB). Free memory was 103.3MB in the beginning and 207.9MB in the end (delta: -104.6MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. [2024-02-10 01:20:12,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.89ms. Allocated memory is still 247.5MB. Free memory was 207.3MB in the beginning and 205.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:20:12,212 INFO L158 Benchmark]: Boogie Preprocessor took 48.02ms. Allocated memory is still 247.5MB. Free memory was 205.8MB in the beginning and 204.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:20:12,213 INFO L158 Benchmark]: RCFGBuilder took 611.56ms. Allocated memory is still 247.5MB. Free memory was 204.7MB in the beginning and 187.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-02-10 01:20:12,213 INFO L158 Benchmark]: BuchiAutomizer took 34513.72ms. Allocated memory was 247.5MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 187.9MB in the beginning and 967.2MB in the end (delta: -779.3MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-02-10 01:20:12,219 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 172.0MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 422.40ms. Allocated memory was 172.0MB in the beginning and 247.5MB in the end (delta: 75.5MB). Free memory was 103.3MB in the beginning and 207.9MB in the end (delta: -104.6MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.89ms. Allocated memory is still 247.5MB. Free memory was 207.3MB in the beginning and 205.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.02ms. Allocated memory is still 247.5MB. Free memory was 205.8MB in the beginning and 204.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 611.56ms. Allocated memory is still 247.5MB. Free memory was 204.7MB in the beginning and 187.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 34513.72ms. Allocated memory was 247.5MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 187.9MB in the beginning and 967.2MB in the end (delta: -779.3MB). Peak memory consumption was 1.2GB. 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 (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function ((-1 * i) + N1) and consists of 7 locations. One deterministic module has affine ranking function (N2 + (-1 * i)) and consists of 8 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.4s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 2.5s. Construction of modules took 0.3s. Büchi inclusion checks took 29.3s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 5/5 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 943 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 941 mSDsluCounter, 2040 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1274 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 361 IncrementalHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 766 mSDtfsCounter, 361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax283 hnf100 lsp22 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 53ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-10 01:20:12,252 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...