/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.fairness.type.for.concurrent.programs FAIRNESS_INTERSECTION -i ../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-17 11:43:10,330 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-17 11:43:10,400 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-09-17 11:43:10,424 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-17 11:43:10,425 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-17 11:43:10,426 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-17 11:43:10,427 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-17 11:43:10,427 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-17 11:43:10,427 INFO L137 SettingsManager]: * Use SBE=true [2023-09-17 11:43:10,428 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-17 11:43:10,428 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-17 11:43:10,428 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-17 11:43:10,429 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-17 11:43:10,429 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-17 11:43:10,429 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-17 11:43:10,429 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-17 11:43:10,430 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-17 11:43:10,430 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-17 11:43:10,430 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-17 11:43:10,431 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-17 11:43:10,431 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-17 11:43:10,434 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-17 11:43:10,435 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-17 11:43:10,435 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-17 11:43:10,439 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-17 11:43:10,439 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-17 11:43:10,439 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-17 11:43:10,439 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-17 11:43:10,439 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-17 11:43:10,440 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-17 11:43:10,441 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-17 11:43:10,441 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-17 11:43:10,441 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-17 11:43:10,441 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-17 11:43:10,442 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-17 11:43:10,443 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Fairness type for concurrent programs -> FAIRNESS_INTERSECTION [2023-09-17 11:43:10,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-17 11:43:10,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-17 11:43:10,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-17 11:43:10,698 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-17 11:43:10,699 INFO L274 PluginConnector]: CDTParser initialized [2023-09-17 11:43:10,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c [2023-09-17 11:43:11,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-17 11:43:12,142 INFO L384 CDTParser]: Found 1 translation units. [2023-09-17 11:43:12,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c [2023-09-17 11:43:12,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e0cef397/4dfc9655a0b142a99bf86f9bad8a7bca/FLAG9e3f495e5 [2023-09-17 11:43:12,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e0cef397/4dfc9655a0b142a99bf86f9bad8a7bca [2023-09-17 11:43:12,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-17 11:43:12,171 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-17 11:43:12,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-17 11:43:12,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-17 11:43:12,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-17 11:43:12,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:43:12" (1/1) ... [2023-09-17 11:43:12,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21dc27de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:43:12, skipping insertion in model container [2023-09-17 11:43:12,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:43:12" (1/1) ... [2023-09-17 11:43:12,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-17 11:43:12,203 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-17 11:43:12,356 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c[1991,2004] [2023-09-17 11:43:12,357 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:43:12,368 INFO L203 MainTranslator]: Completed pre-run [2023-09-17 11:43:12,387 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c[1991,2004] [2023-09-17 11:43:12,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:43:12,397 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:43:12,397 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:43:12,403 INFO L208 MainTranslator]: Completed translation [2023-09-17 11:43:12,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:43:12 WrapperNode [2023-09-17 11:43:12,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-17 11:43:12,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-17 11:43:12,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-17 11:43:12,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-17 11:43:12,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:43:12" (1/1) ... [2023-09-17 11:43:12,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:43:12" (1/1) ... [2023-09-17 11:43:12,437 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2023-09-17 11:43:12,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-17 11:43:12,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-17 11:43:12,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-17 11:43:12,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-17 11:43:12,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:43:12" (1/1) ... [2023-09-17 11:43:12,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:43:12" (1/1) ... [2023-09-17 11:43:12,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:43:12" (1/1) ... [2023-09-17 11:43:12,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:43:12" (1/1) ... [2023-09-17 11:43:12,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:43:12" (1/1) ... [2023-09-17 11:43:12,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:43:12" (1/1) ... [2023-09-17 11:43:12,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:43:12" (1/1) ... [2023-09-17 11:43:12,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:43:12" (1/1) ... [2023-09-17 11:43:12,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-17 11:43:12,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-17 11:43:12,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-17 11:43:12,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-17 11:43:12,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:43:12" (1/1) ... [2023-09-17 11:43:12,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:43:12,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:43:12,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:43:12,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-09-17 11:43:12,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-17 11:43:12,533 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-17 11:43:12,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-17 11:43:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-17 11:43:12,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-17 11:43:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-17 11:43:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-17 11:43:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-17 11:43:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-17 11:43:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-17 11:43:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-17 11:43:12,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-17 11:43:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-17 11:43:12,536 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-17 11:43:12,626 INFO L236 CfgBuilder]: Building ICFG [2023-09-17 11:43:12,630 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-17 11:43:12,828 INFO L277 CfgBuilder]: Performing block encoding [2023-09-17 11:43:12,871 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-17 11:43:12,871 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-17 11:43:12,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:43:12 BoogieIcfgContainer [2023-09-17 11:43:12,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-17 11:43:12,874 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-17 11:43:12,874 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-17 11:43:12,877 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-17 11:43:12,878 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:43:12,878 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 11:43:12" (1/3) ... [2023-09-17 11:43:12,879 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@430d98dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:43:12, skipping insertion in model container [2023-09-17 11:43:12,879 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:43:12,879 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:43:12" (2/3) ... [2023-09-17 11:43:12,879 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@430d98dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:43:12, skipping insertion in model container [2023-09-17 11:43:12,879 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:43:12,879 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:43:12" (3/3) ... [2023-09-17 11:43:12,880 INFO L332 chiAutomizerObserver]: Analyzing ICFG popl20-nonblocking-cntr.wvr.c [2023-09-17 11:43:12,936 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-17 11:43:12,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 69 transitions, 148 flow [2023-09-17 11:43:12,988 INFO L124 PetriNetUnfolderBase]: 6/65 cut-off events. [2023-09-17 11:43:12,989 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-09-17 11:43:12,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 65 events. 6/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2023-09-17 11:43:12,993 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 69 transitions, 148 flow [2023-09-17 11:43:12,998 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 65 transitions, 136 flow [2023-09-17 11:43:13,011 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-17 11:43:13,011 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-17 11:43:13,011 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-17 11:43:13,011 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-17 11:43:13,011 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-17 11:43:13,012 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-17 11:43:13,012 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-17 11:43:13,012 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-17 11:43:13,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 11:43:13,533 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 67 [2023-09-17 11:43:13,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:43:13,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:43:13,543 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:43:13,544 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:43:13,544 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-17 11:43:13,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 11:43:13,856 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 67 [2023-09-17 11:43:13,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:43:13,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:43:13,862 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:43:13,863 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:43:13,880 INFO L748 eck$LassoCheckResult]: Stem: 78#[$Ultimate##0]don't care [148] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 83#[L-1]don't care [152] L-1-->L-1-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[] 87#[L-1-1]don't care [167] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 90#[L21]don't care [147] L21-->L21-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_8| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[] 93#[L21-1]don't care [160] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 96#[L21-2]don't care [159] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[] 99#[L21-3]don't care [137] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 30 (select |v_#length_4| 2))) InVars {#length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[] 102#[L21-4]don't care [175] L21-4-->L38: Formula: (= v_~M~0_6 0) InVars {} OutVars{~M~0=v_~M~0_6} AuxVars[] AssignedVars[~M~0] 105#[L38]don't care [176] L38-->L-1-2: Formula: (= v_~counter~0_8 0) InVars {} OutVars{~counter~0=v_~counter~0_8} AuxVars[] AssignedVars[~counter~0] 108#[L-1-2]don't care [169] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 111#[L-1-3]don't care [172] L-1-3-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|, 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|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 114#[L65]don't care [178] L65-->L65-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1) |v_#valid_10|) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_5|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 117#[L65-1]don't care [164] L65-1-->L65-2: Formula: (and (= (store |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_12|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_7|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 120#[L65-2]don't care [151] L65-2-->L67: 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] 123#[L67]don't care [163] L67-->L67-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_4| v_~M~0_7) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} OutVars{~M~0=v_~M~0_7, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[~M~0] 126#[L67-1]don't care [143] L67-1-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 129#[L68]don't care [166] L68-->L68-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~M~0_5) 1 0)) InVars {~M~0=v_~M~0_5} OutVars{~M~0=v_~M~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] 132#[L68-1]don't care [141] L68-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] 135#[L34]don't care [145] 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] 138#[L35]don't care [162] 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[] 144#[L34-1]don't care [157] L34-1-->L71: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 147#[L71]don't care [120] L71-->L71-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 150#[L71-1]don't care [140] L71-1-->L71-2: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (select |v_#valid_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre6#1_2|)) |v_#memory_int_1|)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_2|, #length=|v_#length_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 153#[L71-2]don't care [202] L71-2-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, 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] 159#[$Ultimate##0, L71-3]don't care [149] L71-3-->L71-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 170#[$Ultimate##0, L71-4]don't care [132] L71-4-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 188#[L72, $Ultimate##0]don't care [177] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1] 213#[L72-1, $Ultimate##0]don't care [115] L72-1-->L72-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 254#[L72-2, $Ultimate##0]don't care [124] L72-2-->L72-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) |v_ULTIMATE.start_main_~#t2~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre8#1_2|)) |v_#memory_int_3|) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (select |v_#length_2| |v_ULTIMATE.start_main_~#t2~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|)) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|, #length=|v_#length_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|, #length=|v_#length_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[#memory_int] 314#[$Ultimate##0, L72-3]don't care [180] $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] 390#[L72-3, L41-4]don't care [199] L72-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_12, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_6|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, thread2Thread1of1ForFork0_#t~post4, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 485#[L72-4, $Ultimate##0, L41-4]don't care [170] L72-4-->L72-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1] 596#[$Ultimate##0, L41-4, L72-5]don't care [118] L72-5-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 726#[$Ultimate##0, L41-4, L74]don't care [116] L74-->L74-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (not (= v_~counter~0_7 0)) 1 0)) InVars {~counter~0=v_~counter~0_7} OutVars{~counter~0=v_~counter~0_7, 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] 917#[$Ultimate##0, L41-4, L74-1]don't care [150] L74-1-->L34-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] 1240#[L34-2, $Ultimate##0, L41-4]don't care [153] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1698#[$Ultimate##0, L35-3, L41-4]don't care [129] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 2293#[$Ultimate##0, L41-4, L34-3]don't care [135] L34-3-->L77: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] 2998#[$Ultimate##0, L77, L41-4]don't care [130] L77-->L65-3: Formula: (= |v_ULTIMATE.start_main_#res#1_1| 0) InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 3774#[$Ultimate##0, L41-4, L65-3]don't care [119] L65-3-->L65-4: Formula: (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0) |v_#valid_3|) InVars {ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[#valid] 4633#[$Ultimate##0, L65-4, L41-4]don't care [138] L65-4-->L65-5: Formula: true InVars {} OutVars{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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 5550#[$Ultimate##0, L41-4, L65-5]don't care [142] L65-5-->L65-6: Formula: (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) InVars {ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[#valid] 6469#[$Ultimate##0, L41-4, L65-6]don't care [139] L65-6-->main_returnLabel#1: Formula: true InVars {} OutVars{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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 7359#[$Ultimate##0, main_returnLabel#1, L41-4]don't care [171] main_returnLabel#1-->ULTIMATE.startFINAL: Formula: (= |v_ULTIMATE.start_main_#res#1_2| |v_ULTIMATE.start_#t~ret10#1_1|) InVars {ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|, ULTIMATE.start_#t~ret10#1=|v_ULTIMATE.start_#t~ret10#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret10#1] 8202#[ULTIMATE.startFINAL, $Ultimate##0, L41-4]don't care [179] ULTIMATE.startFINAL-->ULTIMATE.startEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 9001#[ULTIMATE.startEXIT, $Ultimate##0, L41-4]don't care [190] $Ultimate##0-->L54-1: Formula: (= v_thread2Thread1of1ForFork0_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1] 9758#[ULTIMATE.startEXIT, L41-4, L54-1]don't care [181] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~M~0_2) InVars {~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3} OutVars{~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3} AuxVars[] AssignedVars[] 10489#[ULTIMATE.startEXIT, L42, L54-1]don't care [2023-09-17 11:43:13,881 INFO L750 eck$LassoCheckResult]: Loop: 10489#[ULTIMATE.startEXIT, L42, L54-1]don't care [191] L54-1-->L53: Formula: (< v_thread2Thread1of1ForFork0_~i~1_3 v_~M~0_4) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_3, ~M~0=v_~M~0_4} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_3, ~M~0=v_~M~0_4} AuxVars[] AssignedVars[] 11149#[ULTIMATE.startEXIT, L53, L42]don't care [184] L42-->L44: Formula: (= (+ v_~counter~0_26 1) v_~counter~0_25) InVars {~counter~0=v_~counter~0_26} OutVars{~counter~0=v_~counter~0_25, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post2] 11718#[ULTIMATE.startEXIT, L53, L44]don't care [186] L44-->L41-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_thread1Thread1of1ForFork1_~i~0_7) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 11989#[ULTIMATE.startEXIT, L41-2, L53]don't care [188] L41-2-->L41-3: Formula: (= v_thread1Thread1of1ForFork1_~i~0_9 (+ |v_thread1Thread1of1ForFork1_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 12253#[L41-3, ULTIMATE.startEXIT, L53]don't care [189] L41-3-->L41-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 12373#[ULTIMATE.startEXIT, L41-4, L53]don't care [194] L53-->L54-1: Formula: (or (and (< 0 v_~counter~0_In_1) (= (+ v_thread2Thread1of1ForFork0_~i~1_7 1) v_thread2Thread1of1ForFork0_~i~1_8) (= v_~counter~0_In_1 (+ v_~counter~0_Out_2 1))) (and (= v_thread2Thread1of1ForFork0_~i~1_8 v_thread2Thread1of1ForFork0_~i~1_7) (= v_~counter~0_Out_2 v_~counter~0_In_1) (= |v_thread2Thread1of1ForFork0_#t~post4_2| |v_thread2Thread1of1ForFork0_#t~post4_1|) (= |v_thread2Thread1of1ForFork0_#t~post3_2| |v_thread2Thread1of1ForFork0_#t~post3_1|) (<= v_~counter~0_In_1 0))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_7, ~counter~0=v_~counter~0_In_1, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_1|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_1|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_8, ~counter~0=v_~counter~0_Out_2, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_2|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread2Thread1of1ForFork0_#t~post3, thread2Thread1of1ForFork0_#t~post4] 9758#[ULTIMATE.startEXIT, L41-4, L54-1]don't care [181] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~M~0_2) InVars {~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3} OutVars{~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3} AuxVars[] AssignedVars[] 10489#[ULTIMATE.startEXIT, L42, L54-1]don't care [2023-09-17 11:43:13,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:43:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash -348375143, now seen corresponding path program 1 times [2023-09-17 11:43:13,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:43:13,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997905884] [2023-09-17 11:43:13,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:43:13,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:43:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:43:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:43:14,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-17 11:43:14,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997905884] [2023-09-17 11:43:14,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997905884] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-17 11:43:14,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-17 11:43:14,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-17 11:43:14,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322372301] [2023-09-17 11:43:14,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-17 11:43:14,134 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-09-17 11:43:14,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:43:14,135 INFO L85 PathProgramCache]: Analyzing trace with hash 607681492, now seen corresponding path program 1 times [2023-09-17 11:43:14,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:43:14,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751920112] [2023-09-17 11:43:14,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:43:14,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:43:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:43:14,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:43:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:43:14,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:43:14,418 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 11:43:14,419 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 11:43:14,419 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 11:43:14,419 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 11:43:14,419 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-09-17 11:43:14,419 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:43:14,419 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 11:43:14,419 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 11:43:14,420 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-nonblocking-cntr.wvr.c_BEv2_Iteration1_Loop [2023-09-17 11:43:14,420 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 11:43:14,420 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 11:43:14,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:43:14,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:43:14,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:43:14,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:43:14,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:43:14,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:43:14,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:43:14,690 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-09-17 11:43:14,849 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 11:43:14,849 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-09-17 11:43:14,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:43:14,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:43:14,857 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:43:14,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-09-17 11:43:14,863 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-17 11:43:14,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-09-17 11:43:14,887 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-09-17 11:43:14,887 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: [] [2023-09-17 11:43:14,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-09-17 11:43:14,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:43:14,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:43:14,899 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:43:14,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-09-17 11:43:14,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-17 11:43:14,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-09-17 11:43:14,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-09-17 11:43:14,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:43:14,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:43:14,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:43:14,951 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-09-17 11:43:14,951 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-17 11:43:14,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-09-17 11:43:15,348 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-09-17 11:43:15,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-09-17 11:43:15,353 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 11:43:15,353 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 11:43:15,353 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 11:43:15,354 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 11:43:15,354 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-17 11:43:15,354 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:43:15,354 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 11:43:15,367 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 11:43:15,367 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-nonblocking-cntr.wvr.c_BEv2_Iteration1_Loop [2023-09-17 11:43:15,367 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 11:43:15,367 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 11:43:15,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:43:15,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:43:15,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:43:15,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:43:15,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:43:15,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:43:15,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:43:15,566 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-09-17 11:43:15,694 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 11:43:15,698 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-17 11:43:15,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:43:15,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:43:15,700 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:43:15,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-09-17 11:43:15,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:43:15,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:43:15,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:43:15,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:43:15,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:43:15,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:43:15,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:43:15,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:43:15,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-09-17 11:43:15,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:43:15,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:43:15,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:43:15,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-09-17 11:43:15,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:43:15,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:43:15,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:43:15,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:43:15,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:43:15,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 11:43:15,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 11:43:15,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 11:43:15,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-09-17 11:43:15,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:43:15,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:43:15,782 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:43:15,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-09-17 11:43:15,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:43:15,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:43:15,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:43:15,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:43:15,796 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-09-17 11:43:15,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:43:15,801 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-09-17 11:43:15,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:43:15,817 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-17 11:43:15,841 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-09-17 11:43:15,842 INFO L444 ModelExtractionUtils]: 5 out of 8 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-09-17 11:43:15,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:43:15,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:43:15,875 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:43:15,881 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-17 11:43:15,881 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-09-17 11:43:15,881 INFO L513 LassoAnalysis]: Proved termination. [2023-09-17 11:43:15,882 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0, ~M~0) = -1*thread1Thread1of1ForFork1_~i~0 + 1*~M~0 Supporting invariants [] [2023-09-17 11:43:15,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-09-17 11:43:15,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-09-17 11:43:15,892 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-09-17 11:43:15,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:43:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:43:15,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjunts are in the unsatisfiable core [2023-09-17 11:43:15,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:43:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:43:16,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-17 11:43:16,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:43:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:43:16,123 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-09-17 11:43:16,126 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand null Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:43:16,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-09-17 11:43:17,014 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand null. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 35660 states and 115118 transitions. Complement of second has 11 states. [2023-09-17 11:43:17,016 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 [2023-09-17 11:43:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:43:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 217 transitions. [2023-09-17 11:43:17,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 217 transitions. Stem has 47 letters. Loop has 7 letters. [2023-09-17 11:43:17,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:43:17,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 217 transitions. Stem has 54 letters. Loop has 7 letters. [2023-09-17 11:43:17,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:43:17,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 217 transitions. Stem has 47 letters. Loop has 14 letters. [2023-09-17 11:43:17,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:43:17,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35660 states and 115118 transitions. [2023-09-17 11:43:17,827 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 11:43:17,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35660 states to 0 states and 0 transitions. [2023-09-17 11:43:17,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-17 11:43:17,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-17 11:43:17,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-17 11:43:17,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 11:43:17,831 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:43:17,831 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:43:17,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-17 11:43:17,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-17 11:43:17,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-17 11:43:17,835 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:43:17,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-17 11:43:17,836 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2023-09-17 11:43:17,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2023-09-17 11:43:17,837 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 11:43:17,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2023-09-17 11:43:17,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-17 11:43:17,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-17 11:43:17,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-17 11:43:17,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 11:43:17,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:43:17,837 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:43:17,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-17 11:43:17,838 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:43:17,838 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-17 11:43:17,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-09-17 11:43:17,838 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 11:43:17,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-09-17 11:43:17,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 11:43:17 BoogieIcfgContainer [2023-09-17 11:43:17,845 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-17 11:43:17,847 INFO L158 Benchmark]: Toolchain (without parser) took 5674.75ms. Allocated memory was 192.9MB in the beginning and 340.8MB in the end (delta: 147.8MB). Free memory was 149.4MB in the beginning and 187.5MB in the end (delta: -38.1MB). Peak memory consumption was 110.1MB. Max. memory is 8.0GB. [2023-09-17 11:43:17,847 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 192.9MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 11:43:17,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.31ms. Allocated memory is still 192.9MB. Free memory was 149.1MB in the beginning and 138.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-09-17 11:43:17,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.02ms. Allocated memory is still 192.9MB. Free memory was 138.4MB in the beginning and 136.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-17 11:43:17,853 INFO L158 Benchmark]: Boogie Preprocessor took 16.44ms. Allocated memory is still 192.9MB. Free memory was 136.8MB in the beginning and 135.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 11:43:17,853 INFO L158 Benchmark]: RCFGBuilder took 417.45ms. Allocated memory is still 192.9MB. Free memory was 135.4MB in the beginning and 122.1MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-09-17 11:43:17,853 INFO L158 Benchmark]: BuchiAutomizer took 4971.37ms. Allocated memory was 192.9MB in the beginning and 340.8MB in the end (delta: 147.8MB). Free memory was 121.8MB in the beginning and 187.5MB in the end (delta: -65.7MB). Peak memory consumption was 82.9MB. Max. memory is 8.0GB. [2023-09-17 11:43:17,859 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.13ms. Allocated memory is still 192.9MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.31ms. Allocated memory is still 192.9MB. Free memory was 149.1MB in the beginning and 138.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.02ms. Allocated memory is still 192.9MB. Free memory was 138.4MB in the beginning and 136.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.44ms. Allocated memory is still 192.9MB. Free memory was 136.8MB in the beginning and 135.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 417.45ms. Allocated memory is still 192.9MB. Free memory was 135.4MB in the beginning and 122.1MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 4971.37ms. Allocated memory was 192.9MB in the beginning and 340.8MB in the end (delta: 147.8MB). Free memory was 121.8MB in the beginning and 187.5MB in the end (delta: -65.7MB). Peak memory consumption was 82.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + M and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.0s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.8s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 110 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 94 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital48 mio100 ax166 hnf100 lsp187 ukn46 mio100 lsp100 div100 bol100 ite100 ukn100 eq163 hnf99 smp100 dnf231 smp34 tf102 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-09-17 11:43:17,884 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...