/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_LAZY -i ../../../trunk/examples/svcomp/weaver/test-easy1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-17 12:09:29,204 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-17 12:09:29,268 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 12:09:29,290 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-17 12:09:29,291 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-17 12:09:29,291 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-17 12:09:29,292 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-17 12:09:29,293 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-17 12:09:29,293 INFO L137 SettingsManager]: * Use SBE=true [2023-09-17 12:09:29,297 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-17 12:09:29,297 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-17 12:09:29,297 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-17 12:09:29,298 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-17 12:09:29,299 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-17 12:09:29,299 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-17 12:09:29,299 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-17 12:09:29,299 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-17 12:09:29,300 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-17 12:09:29,300 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-17 12:09:29,300 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-17 12:09:29,300 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-17 12:09:29,301 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-17 12:09:29,301 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-17 12:09:29,301 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-17 12:09:29,301 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-17 12:09:29,302 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-17 12:09:29,302 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-17 12:09:29,303 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-17 12:09:29,303 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-17 12:09:29,303 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-17 12:09:29,304 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-17 12:09:29,304 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-17 12:09:29,304 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-17 12:09:29,305 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-17 12:09:29,306 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-17 12:09:29,306 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_LAZY [2023-09-17 12:09:29,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-17 12:09:29,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-17 12:09:29,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-17 12:09:29,575 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-17 12:09:29,576 INFO L274 PluginConnector]: CDTParser initialized [2023-09-17 12:09:29,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy1.wvr.c [2023-09-17 12:09:30,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-17 12:09:31,114 INFO L384 CDTParser]: Found 1 translation units. [2023-09-17 12:09:31,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c [2023-09-17 12:09:31,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3efd1d90f/39c09f154d724b189b8fd84a854956db/FLAGaac29cb8c [2023-09-17 12:09:31,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3efd1d90f/39c09f154d724b189b8fd84a854956db [2023-09-17 12:09:31,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-17 12:09:31,142 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-17 12:09:31,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-17 12:09:31,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-17 12:09:31,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-17 12:09:31,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 12:09:31" (1/1) ... [2023-09-17 12:09:31,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5118cd5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:31, skipping insertion in model container [2023-09-17 12:09:31,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 12:09:31" (1/1) ... [2023-09-17 12:09:31,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-17 12:09:31,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-17 12:09:31,326 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/test-easy1.wvr.c[1830,1843] [2023-09-17 12:09:31,327 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 12:09:31,337 INFO L203 MainTranslator]: Completed pre-run [2023-09-17 12:09:31,352 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/test-easy1.wvr.c[1830,1843] [2023-09-17 12:09:31,352 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 12:09:31,364 INFO L208 MainTranslator]: Completed translation [2023-09-17 12:09:31,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:31 WrapperNode [2023-09-17 12:09:31,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-17 12:09:31,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-17 12:09:31,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-17 12:09:31,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-17 12:09:31,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:31" (1/1) ... [2023-09-17 12:09:31,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:31" (1/1) ... [2023-09-17 12:09:31,397 INFO L138 Inliner]: procedures = 21, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2023-09-17 12:09:31,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-17 12:09:31,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-17 12:09:31,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-17 12:09:31,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-17 12:09:31,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:31" (1/1) ... [2023-09-17 12:09:31,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:31" (1/1) ... [2023-09-17 12:09:31,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:31" (1/1) ... [2023-09-17 12:09:31,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:31" (1/1) ... [2023-09-17 12:09:31,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:31" (1/1) ... [2023-09-17 12:09:31,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:31" (1/1) ... [2023-09-17 12:09:31,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:31" (1/1) ... [2023-09-17 12:09:31,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:31" (1/1) ... [2023-09-17 12:09:31,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-17 12:09:31,419 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-17 12:09:31,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-17 12:09:31,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-17 12:09:31,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:31" (1/1) ... [2023-09-17 12:09:31,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:09:31,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:09:31,455 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 12:09:31,478 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 12:09:31,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-17 12:09:31,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-17 12:09:31,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-17 12:09:31,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-17 12:09:31,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-17 12:09:31,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-17 12:09:31,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-17 12:09:31,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-17 12:09:31,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-17 12:09:31,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-17 12:09:31,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-17 12:09:31,498 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 12:09:31,596 INFO L236 CfgBuilder]: Building ICFG [2023-09-17 12:09:31,600 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-17 12:09:31,803 INFO L277 CfgBuilder]: Performing block encoding [2023-09-17 12:09:31,809 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-17 12:09:31,809 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-17 12:09:31,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 12:09:31 BoogieIcfgContainer [2023-09-17 12:09:31,815 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-17 12:09:31,816 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-17 12:09:31,816 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-17 12:09:31,820 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-17 12:09:31,820 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 12:09:31,820 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 12:09:31" (1/3) ... [2023-09-17 12:09:31,821 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3307fcf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 12:09:31, skipping insertion in model container [2023-09-17 12:09:31,821 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 12:09:31,821 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:31" (2/3) ... [2023-09-17 12:09:31,822 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3307fcf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 12:09:31, skipping insertion in model container [2023-09-17 12:09:31,822 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 12:09:31,822 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 12:09:31" (3/3) ... [2023-09-17 12:09:31,823 INFO L332 chiAutomizerObserver]: Analyzing ICFG test-easy1.wvr.c [2023-09-17 12:09:31,887 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-17 12:09:31,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 71 transitions, 152 flow [2023-09-17 12:09:31,944 INFO L124 PetriNetUnfolderBase]: 6/67 cut-off events. [2023-09-17 12:09:31,944 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-09-17 12:09:31,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 67 events. 6/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2023-09-17 12:09:31,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 71 transitions, 152 flow [2023-09-17 12:09:31,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 67 transitions, 140 flow [2023-09-17 12:09:31,968 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-17 12:09:31,968 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-17 12:09:31,968 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-17 12:09:31,968 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-17 12:09:31,968 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-17 12:09:31,969 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-17 12:09:31,969 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-17 12:09:31,969 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-17 12:09:31,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 12:09:33,051 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2023-09-17 12:09:33,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 12:09:33,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 12:09:33,062 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, 1] [2023-09-17 12:09:33,062 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:09:33,064 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-17 12:09:33,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 12:09:33,791 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2023-09-17 12:09:33,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 12:09:33,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 12:09:33,798 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, 1] [2023-09-17 12:09:33,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:09:33,809 INFO L748 eck$LassoCheckResult]: Stem: SleepPredicate [underlying: 73#[$Ultimate##0]don't care, sleep set: []] [114] $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] SleepPredicate [underlying: 76#[L-1]don't care, sleep set: []] [123] L-1-->L-1-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 78#[L-1-1]don't care, sleep set: []] [146] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 80#[L21]don't care, sleep set: []] [113] 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[] SleepPredicate [underlying: 82#[L21-1]don't care, sleep set: []] [137] 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[] SleepPredicate [underlying: 84#[L21-2]don't care, sleep set: []] [136] 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[] SleepPredicate [underlying: 86#[L21-3]don't care, sleep set: []] [105] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 88#[L21-4]don't care, sleep set: []] [153] L21-4-->L38: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] SleepPredicate [underlying: 90#[L38]don't care, sleep set: []] [154] L38-->L-1-2: Formula: (= v_~x2~0_5 0) InVars {} OutVars{~x2~0=v_~x2~0_5} AuxVars[] AssignedVars[~x2~0] SleepPredicate [underlying: 92#[L-1-2]don't care, sleep set: []] [148] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] SleepPredicate [underlying: 94#[L-1-3]don't care, sleep set: []] [151] L-1-3-->L57: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_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|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] SleepPredicate [underlying: 96#[L57]don't care, sleep set: []] [155] L57-->L57-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) 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_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] SleepPredicate [underlying: 98#[L57-1]don't care, sleep set: []] [103] L57-1-->L57-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) 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_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] SleepPredicate [underlying: 100#[L57-2]don't care, sleep set: []] [145] L57-2-->L59: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] SleepPredicate [underlying: 102#[L59]don't care, sleep set: []] [119] L59-->L59-1: Formula: (= v_~x1~0_6 |v_ULTIMATE.start_main_#t~nondet3#1_3|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|, ~x1~0=v_~x1~0_6} AuxVars[] AssignedVars[~x1~0] SleepPredicate [underlying: 104#[L59-1]don't care, sleep set: []] [99] L59-1-->L60: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] SleepPredicate [underlying: 106#[L60]don't care, sleep set: []] [149] L60-->L60-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] SleepPredicate [underlying: 108#[L60-1]don't care, sleep set: []] [121] L60-1-->L60-2: Formula: (= v_~x2~0_6 |v_ULTIMATE.start_main_#t~nondet4#1_3|) InVars {ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} OutVars{~x2~0=v_~x2~0_6, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[~x2~0] SleepPredicate [underlying: 110#[L60-2]don't care, sleep set: []] [109] L60-2-->L61: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] SleepPredicate [underlying: 112#[L61]don't care, sleep set: []] [93] L61-->L61-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~x1~0_7) (= v_~x1~0_7 v_~x2~0_7)) 1 0)) InVars {~x2~0=v_~x2~0_7, ~x1~0=v_~x1~0_7} OutVars{~x2~0=v_~x2~0_7, ~x1~0=v_~x1~0_7, 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] SleepPredicate [underlying: 114#[L61-1]don't care, sleep set: []] [131] L61-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] SleepPredicate [underlying: 116#[L34]don't care, sleep set: []] [112] 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] SleepPredicate [underlying: 118#[L35]don't care, sleep set: []] [139] 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[] SleepPredicate [underlying: 122#[L34-1]don't care, sleep set: []] [133] L34-1-->L64: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] SleepPredicate [underlying: 124#[L64]don't care, sleep set: []] [108] L64-->L64-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] SleepPredicate [underlying: 126#[L64-1]don't care, sleep set: []] [147] L64-1-->L64-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, 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|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, 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[#memory_int] SleepPredicate [underlying: 128#[L64-2]don't care, sleep set: []] [178] L64-2-->L41-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] SleepPredicate [underlying: 130#[L64-3, L41-1]don't care, sleep set: []] [102] L64-3-->L64-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] SleepPredicate [underlying: 136#[L41-1, L64-4]don't care, sleep set: [thread1Thread1of1ForFork0]] [124] L64-4-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] SleepPredicate [underlying: 146#[L65, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [158] L65-->L65-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] SleepPredicate [underlying: 160#[L65-1, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [142] L65-1-->L65-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] SleepPredicate [underlying: 174#[L41-1, L65-2]don't care, sleep set: [thread1Thread1of1ForFork0]] [122] L65-2-->L65-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_5|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|)) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] SleepPredicate [underlying: 188#[L65-3, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [181] L65-3-->L49-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_8|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] SleepPredicate [underlying: 202#[L65-4, L49-1, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [106] L65-4-->L65-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] SleepPredicate [underlying: 220#[L49-1, L65-5, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [110] L65-5-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] SleepPredicate [underlying: 250#[L67, L49-1, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [140] L67-->L67-1: Formula: (= (ite (not (= v_~x1~0_8 v_~x2~0_8)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {~x2~0=v_~x2~0_8, ~x1~0=v_~x1~0_8} OutVars{~x2~0=v_~x2~0_8, ~x1~0=v_~x1~0_8, 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] SleepPredicate [underlying: 300#[L67-1, L49-1, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [111] L67-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] SleepPredicate [underlying: 374#[L49-1, L34-2, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [125] 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] SleepPredicate [underlying: 464#[L35-3, L49-1, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [98] 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[] SleepPredicate [underlying: 564#[L34-3, L49-1, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [104] L34-3-->L70: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] SleepPredicate [underlying: 670#[L49-1, L70, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [156] L70-->L57-3: Formula: (= |v_ULTIMATE.start_main_#res#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] SleepPredicate [underlying: 784#[L49-1, L57-3, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [144] L57-3-->L57-4: Formula: (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0) |v_#valid_10|) InVars {ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid] SleepPredicate [underlying: 906#[L57-4, L49-1, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [141] L57-4-->L57-5: Formula: true InVars {} OutVars{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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] SleepPredicate [underlying: 1028#[L57-5, L49-1, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [132] L57-5-->L57-6: Formula: (= |v_#valid_12| (store |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) InVars {ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#valid] SleepPredicate [underlying: 1142#[L49-1, L57-6, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [134] L57-6-->main_returnLabel#1: Formula: true InVars {} OutVars{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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] SleepPredicate [underlying: 1248#[main_returnLabel#1, L49-1, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [150] main_returnLabel#1-->ULTIMATE.startFINAL: Formula: (= |v_ULTIMATE.start_main_#res#1_3| |v_ULTIMATE.start_#t~ret9#1_1|) InVars {ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|, ULTIMATE.start_#t~ret9#1=|v_ULTIMATE.start_#t~ret9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret9#1] SleepPredicate [underlying: 1346#[L49-1, ULTIMATE.startFINAL, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [159] ULTIMATE.startFINAL-->ULTIMATE.startEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] SleepPredicate [underlying: 1444#[L49-1, ULTIMATE.startEXIT, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [160] L41-1-->L42: Formula: (< v_~x1~0_2 10000) InVars {~x1~0=v_~x1~0_2} OutVars{~x1~0=v_~x1~0_2} AuxVars[] AssignedVars[] SleepPredicate [underlying: 1486#[L42, L49-1, ULTIMATE.startEXIT]don't care, sleep set: []] [2023-09-17 12:09:33,810 INFO L750 eck$LassoCheckResult]: Loop: SleepPredicate [underlying: 1486#[L42, L49-1, ULTIMATE.startEXIT]don't care, sleep set: []] [168] L49-1-->L50: Formula: (< v_~x2~0_2 10000) InVars {~x2~0=v_~x2~0_2} OutVars{~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[] SleepPredicate [underlying: 1574#[L42, L50, ULTIMATE.startEXIT]don't care, sleep set: [thread1Thread1of1ForFork0]] [163] L42-->L42-1: Formula: (= v_~x1~0_3 |v_thread1Thread1of1ForFork0_#t~post1_1|) InVars {~x1~0=v_~x1~0_3} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] SleepPredicate [underlying: 1648#[L42-1, L50, ULTIMATE.startEXIT]don't care, sleep set: []] [165] L42-1-->L42-2: Formula: (= v_~x1~0_4 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|, ~x1~0=v_~x1~0_4} AuxVars[] AssignedVars[~x1~0] SleepPredicate [underlying: 1706#[L42-2, L50, ULTIMATE.startEXIT]don't care, sleep set: [thread2Thread1of1ForFork1]] [167] L42-2-->L41-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] SleepPredicate [underlying: 1534#[L50, ULTIMATE.startEXIT, L41-1]don't care, sleep set: [thread2Thread1of1ForFork1]] [171] L50-->L50-1: Formula: (= v_~x2~0_3 |v_thread2Thread1of1ForFork1_#t~post2_1|) InVars {~x2~0=v_~x2~0_3} OutVars{~x2~0=v_~x2~0_3, thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2] SleepPredicate [underlying: 1624#[L50-1, ULTIMATE.startEXIT, L41-1]don't care, sleep set: []] [173] L50-1-->L50-2: Formula: (= v_~x2~0_4 (+ |v_thread2Thread1of1ForFork1_#t~post2_3| 1)) InVars {thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_3|} OutVars{~x2~0=v_~x2~0_4, thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_3|} AuxVars[] AssignedVars[~x2~0] SleepPredicate [underlying: 1698#[L50-2, ULTIMATE.startEXIT, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [175] L50-2-->L49-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2] SleepPredicate [underlying: 1444#[L49-1, ULTIMATE.startEXIT, L41-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [160] L41-1-->L42: Formula: (< v_~x1~0_2 10000) InVars {~x1~0=v_~x1~0_2} OutVars{~x1~0=v_~x1~0_2} AuxVars[] AssignedVars[] SleepPredicate [underlying: 1486#[L42, L49-1, ULTIMATE.startEXIT]don't care, sleep set: []] [2023-09-17 12:09:33,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:09:33,816 INFO L85 PathProgramCache]: Analyzing trace with hash -361038893, now seen corresponding path program 1 times [2023-09-17 12:09:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 12:09:33,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455447039] [2023-09-17 12:09:33,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 12:09:33,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 12:09:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 12:09:34,022 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 12:09:34,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-17 12:09:34,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455447039] [2023-09-17 12:09:34,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455447039] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-17 12:09:34,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-17 12:09:34,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-17 12:09:34,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790264355] [2023-09-17 12:09:34,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-17 12:09:34,033 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-09-17 12:09:34,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:09:34,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1850545647, now seen corresponding path program 1 times [2023-09-17 12:09:34,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 12:09:34,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296850616] [2023-09-17 12:09:34,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 12:09:34,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 12:09:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:09:34,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 12:09:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:09:34,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 12:09:34,165 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 12:09:34,166 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 12:09:34,166 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 12:09:34,166 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 12:09:34,166 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-09-17 12:09:34,166 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:09:34,167 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 12:09:34,167 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 12:09:34,167 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy1.wvr.c_BEv2_Iteration1_Loop [2023-09-17 12:09:34,167 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 12:09:34,167 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 12:09:34,182 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 12:09:34,199 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 12:09:34,206 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 12:09:34,209 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 12:09:34,215 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 12:09:34,218 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 12:09:34,221 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 12:09:34,224 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 12:09:34,298 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 12:09:34,299 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-09-17 12:09:34,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:09:34,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:09:34,304 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 12:09:34,306 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 12:09:34,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-09-17 12:09:34,307 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-17 12:09:34,330 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-09-17 12:09:34,330 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 12:09:34,335 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 12:09:34,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:09:34,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:09:34,337 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 12:09:34,339 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 12:09:34,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-09-17 12:09:34,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-17 12:09:34,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-09-17 12:09:34,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:09:34,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:09:34,361 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 12:09:34,365 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 12:09:34,367 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-09-17 12:09:34,367 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-17 12:09:34,392 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-09-17 12:09:34,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-09-17 12:09:34,397 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 12:09:34,397 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 12:09:34,397 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 12:09:34,397 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 12:09:34,398 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-17 12:09:34,398 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:09:34,398 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 12:09:34,398 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 12:09:34,398 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-easy1.wvr.c_BEv2_Iteration1_Loop [2023-09-17 12:09:34,398 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 12:09:34,398 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 12:09:34,401 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 12:09:34,412 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 12:09:34,421 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 12:09:34,425 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 12:09:34,427 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 12:09:34,436 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 12:09:34,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 12:09:34,446 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 12:09:34,540 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 12:09:34,544 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-17 12:09:34,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:09:34,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:09:34,550 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 12:09:34,560 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 12:09:34,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:09:34,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:09:34,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:09:34,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:09:34,571 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 12:09:34,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 12:09:34,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 12:09:34,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 12:09:34,605 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 12:09:34,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:09:34,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:09:34,609 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 12:09:34,618 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 12:09:34,621 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 12:09:34,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:09:34,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 12:09:34,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:09:34,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:09:34,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:09:34,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 12:09:34,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 12:09:34,643 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-17 12:09:34,647 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-09-17 12:09:34,647 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-09-17 12:09:34,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:09:34,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:09:34,694 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 12:09:34,698 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 12:09:34,699 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-17 12:09:34,700 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-09-17 12:09:34,700 INFO L513 LassoAnalysis]: Proved termination. [2023-09-17 12:09:34,700 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~x2~0) = -2*~x2~0 + 19999 Supporting invariants [] [2023-09-17 12:09:34,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-09-17 12:09:34,709 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-09-17 12:09:34,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:09:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 12:09:34,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjunts are in the unsatisfiable core [2023-09-17 12:09:34,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 12:09:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 12:09:34,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-17 12:09:34,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 12:09:35,035 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 12:09:35,071 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2023-09-17 12:09:35,075 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand null Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 12:09:35,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-09-17 12:09:36,602 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand null. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 17204 states and 57278 transitions. Complement of second has 10 states. [2023-09-17 12:09:36,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-09-17 12:09:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 12:09:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2023-09-17 12:09:36,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 195 transitions. Stem has 48 letters. Loop has 8 letters. [2023-09-17 12:09:36,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 12:09:36,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 195 transitions. Stem has 56 letters. Loop has 8 letters. [2023-09-17 12:09:36,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 12:09:36,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 195 transitions. Stem has 48 letters. Loop has 16 letters. [2023-09-17 12:09:36,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 12:09:36,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17204 states and 57278 transitions. [2023-09-17 12:09:36,939 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2023-09-17 12:09:37,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17204 states to 4169 states and 13621 transitions. [2023-09-17 12:09:37,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 693 [2023-09-17 12:09:37,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1074 [2023-09-17 12:09:37,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4169 states and 13621 transitions. [2023-09-17 12:09:37,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 12:09:37,039 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4169 states and 13621 transitions. [2023-09-17 12:09:37,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states and 13621 transitions. [2023-09-17 12:09:37,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 4088. [2023-09-17 12:09:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4088 states, 4088 states have (on average 3.2847358121330723) internal successors, (13428), 4087 states have internal predecessors, (13428), 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 12:09:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 13428 transitions. [2023-09-17 12:09:37,252 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4088 states and 13428 transitions. [2023-09-17 12:09:37,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-17 12:09:37,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-17 12:09:37,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-17 12:09:37,257 INFO L87 Difference]: Start difference. First operand 4088 states and 13428 transitions. Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 12:09:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-17 12:09:37,293 INFO L93 Difference]: Finished difference Result 2176 states and 6306 transitions. [2023-09-17 12:09:37,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2176 states and 6306 transitions. [2023-09-17 12:09:37,310 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 12:09:37,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2176 states to 0 states and 0 transitions. [2023-09-17 12:09:37,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-17 12:09:37,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-17 12:09:37,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-17 12:09:37,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 12:09:37,344 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 12:09:37,344 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 12:09:37,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-17 12:09:37,345 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 12:09:37,346 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-17 12:09:37,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-09-17 12:09:37,346 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 12:09:37,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-09-17 12:09:37,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 12:09:37 BoogieIcfgContainer [2023-09-17 12:09:37,353 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-17 12:09:37,354 INFO L158 Benchmark]: Toolchain (without parser) took 6211.71ms. Allocated memory was 290.5MB in the beginning and 494.9MB in the end (delta: 204.5MB). Free memory was 245.8MB in the beginning and 448.5MB in the end (delta: -202.7MB). Peak memory consumption was 282.7MB. Max. memory is 8.0GB. [2023-09-17 12:09:37,355 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory was 142.1MB in the beginning and 142.0MB in the end (delta: 123.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 12:09:37,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.41ms. Allocated memory is still 290.5MB. Free memory was 245.4MB in the beginning and 234.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-09-17 12:09:37,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.10ms. Allocated memory is still 290.5MB. Free memory was 234.9MB in the beginning and 233.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 12:09:37,360 INFO L158 Benchmark]: Boogie Preprocessor took 19.79ms. Allocated memory is still 290.5MB. Free memory was 233.6MB in the beginning and 232.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 12:09:37,361 INFO L158 Benchmark]: RCFGBuilder took 396.31ms. Allocated memory is still 290.5MB. Free memory was 232.2MB in the beginning and 220.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-09-17 12:09:37,361 INFO L158 Benchmark]: BuchiAutomizer took 5536.99ms. Allocated memory was 290.5MB in the beginning and 494.9MB in the end (delta: 204.5MB). Free memory was 220.3MB in the beginning and 448.5MB in the end (delta: -228.3MB). Peak memory consumption was 256.5MB. Max. memory is 8.0GB. [2023-09-17 12:09:37,367 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 185.6MB. Free memory was 142.1MB in the beginning and 142.0MB in the end (delta: 123.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.41ms. Allocated memory is still 290.5MB. Free memory was 245.4MB in the beginning and 234.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.10ms. Allocated memory is still 290.5MB. Free memory was 234.9MB in the beginning and 233.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.79ms. Allocated memory is still 290.5MB. Free memory was 233.6MB in the beginning and 232.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 396.31ms. Allocated memory is still 290.5MB. Free memory was 232.2MB in the beginning and 220.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 5536.99ms. Allocated memory was 290.5MB in the beginning and 494.9MB in the end (delta: 204.5MB). Free memory was 220.3MB in the beginning and 448.5MB in the end (delta: -228.3MB). Peak memory consumption was 256.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19999 + -2 * x2 and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 1 MinimizatonAttempts, 81 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.4s 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, 108 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 250 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 149 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax277 hnf100 lsp20 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 51ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 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 12:09:37,392 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...