/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/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-17 11:32:26,475 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-17 11:32:26,519 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:32:26,539 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-17 11:32:26,540 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-17 11:32:26,540 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-17 11:32:26,541 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-17 11:32:26,542 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-17 11:32:26,542 INFO L137 SettingsManager]: * Use SBE=true [2023-09-17 11:32:26,542 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-17 11:32:26,543 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-17 11:32:26,543 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-17 11:32:26,543 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-17 11:32:26,544 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-17 11:32:26,544 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-17 11:32:26,544 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-17 11:32:26,545 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-17 11:32:26,545 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-17 11:32:26,545 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-17 11:32:26,546 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-17 11:32:26,546 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-17 11:32:26,547 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-17 11:32:26,547 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-17 11:32:26,547 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-17 11:32:26,548 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-17 11:32:26,548 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-17 11:32:26,548 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-17 11:32:26,549 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-17 11:32:26,549 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-17 11:32:26,549 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-17 11:32:26,549 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-17 11:32:26,550 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-17 11:32:26,550 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-17 11:32:26,550 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-17 11:32:26,551 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-17 11:32:26,552 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:32:26,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-17 11:32:26,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-17 11:32:26,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-17 11:32:26,811 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-17 11:32:26,811 INFO L274 PluginConnector]: CDTParser initialized [2023-09-17 11:32:26,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-09-17 11:32:27,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-17 11:32:28,148 INFO L384 CDTParser]: Found 1 translation units. [2023-09-17 11:32:28,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-09-17 11:32:28,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b24d23d12/6fda1e8d43df413b9ae2a1400f9e0b3d/FLAG83746fe2f [2023-09-17 11:32:28,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b24d23d12/6fda1e8d43df413b9ae2a1400f9e0b3d [2023-09-17 11:32:28,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-17 11:32:28,180 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-17 11:32:28,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-17 11:32:28,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-17 11:32:28,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-17 11:32:28,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:32:28" (1/1) ... [2023-09-17 11:32:28,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74084891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:32:28, skipping insertion in model container [2023-09-17 11:32:28,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:32:28" (1/1) ... [2023-09-17 11:32:28,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-17 11:32:28,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-17 11:32:28,368 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/bench-exp1x3.wvr.c[1803,1816] [2023-09-17 11:32:28,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:32:28,383 INFO L203 MainTranslator]: Completed pre-run [2023-09-17 11:32:28,405 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/bench-exp1x3.wvr.c[1803,1816] [2023-09-17 11:32:28,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:32:28,420 INFO L208 MainTranslator]: Completed translation [2023-09-17 11:32:28,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:32:28 WrapperNode [2023-09-17 11:32:28,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-17 11:32:28,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-17 11:32:28,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-17 11:32:28,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-17 11:32:28,430 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:32:28" (1/1) ... [2023-09-17 11:32:28,438 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:32:28" (1/1) ... [2023-09-17 11:32:28,455 INFO L138 Inliner]: procedures = 18, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2023-09-17 11:32:28,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-17 11:32:28,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-17 11:32:28,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-17 11:32:28,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-17 11:32:28,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:32:28" (1/1) ... [2023-09-17 11:32:28,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:32:28" (1/1) ... [2023-09-17 11:32:28,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:32:28" (1/1) ... [2023-09-17 11:32:28,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:32:28" (1/1) ... [2023-09-17 11:32:28,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:32:28" (1/1) ... [2023-09-17 11:32:28,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:32:28" (1/1) ... [2023-09-17 11:32:28,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:32:28" (1/1) ... [2023-09-17 11:32:28,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:32:28" (1/1) ... [2023-09-17 11:32:28,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-17 11:32:28,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-17 11:32:28,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-17 11:32:28,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-17 11:32:28,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:32:28" (1/1) ... [2023-09-17 11:32:28,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:32:28,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:32:28,518 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:32:28,532 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:32:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-17 11:32:28,560 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-17 11:32:28,561 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-17 11:32:28,561 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-17 11:32:28,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-17 11:32:28,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-17 11:32:28,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-17 11:32:28,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-17 11:32:28,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-17 11:32:28,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-17 11:32:28,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-17 11:32:28,563 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:32:28,648 INFO L236 CfgBuilder]: Building ICFG [2023-09-17 11:32:28,649 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-17 11:32:28,780 INFO L277 CfgBuilder]: Performing block encoding [2023-09-17 11:32:28,786 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-17 11:32:28,786 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-17 11:32:28,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:32:28 BoogieIcfgContainer [2023-09-17 11:32:28,788 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-17 11:32:28,789 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-17 11:32:28,789 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-17 11:32:28,796 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-17 11:32:28,796 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:32:28,797 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 11:32:28" (1/3) ... [2023-09-17 11:32:28,797 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71dfa798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:32:28, skipping insertion in model container [2023-09-17 11:32:28,797 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:32:28,798 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:32:28" (2/3) ... [2023-09-17 11:32:28,798 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71dfa798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:32:28, skipping insertion in model container [2023-09-17 11:32:28,798 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:32:28,798 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:32:28" (3/3) ... [2023-09-17 11:32:28,799 INFO L332 chiAutomizerObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2023-09-17 11:32:28,874 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-17 11:32:28,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 71 transitions, 152 flow [2023-09-17 11:32:28,933 INFO L124 PetriNetUnfolderBase]: 6/67 cut-off events. [2023-09-17 11:32:28,933 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-09-17 11:32:28,937 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 23 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2023-09-17 11:32:28,937 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 71 transitions, 152 flow [2023-09-17 11:32:28,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 67 transitions, 140 flow [2023-09-17 11:32:28,959 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-17 11:32:28,959 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-17 11:32:28,959 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-17 11:32:28,959 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-17 11:32:28,959 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-17 11:32:28,960 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-17 11:32:28,960 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-17 11:32:28,960 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-17 11:32:28,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 11:32:29,320 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2023-09-17 11:32:29,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:32:29,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:32:29,329 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, 1, 1, 1, 1, 1, 1] [2023-09-17 11:32:29,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-09-17 11:32:29,331 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-17 11:32:29,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 11:32:29,470 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2023-09-17 11:32:29,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:32:29,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:32:29,474 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, 1, 1, 1, 1, 1, 1] [2023-09-17 11:32:29,474 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-09-17 11:32:29,493 INFO L748 eck$LassoCheckResult]: Stem: 80#[$Ultimate##0]don't care [121] $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] 85#[L-1]don't care [131] L-1-->L-1-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 89#[L-1-1]don't care [145] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 92#[L21]don't care [120] 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[] 95#[L21-1]don't care [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[] 98#[L21-2]don't care [135] 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[] 101#[L21-3]don't care [109] L21-3-->L21-4: Formula: (and (= 19 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 104#[L21-4]don't care [153] L21-4-->L35: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] 107#[L35]don't care [138] L35-->L35-1: Formula: (= v_~x2~0_5 0) InVars {} OutVars{~x2~0=v_~x2~0_5} AuxVars[] AssignedVars[~x2~0] 110#[L35-1]don't care [134] L35-1-->L-1-2: Formula: (= v_~n~0_5 0) InVars {} OutVars{~n~0=v_~n~0_5} AuxVars[] AssignedVars[~n~0] 113#[L-1-2]don't care [147] 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] 116#[L-1-3]don't care [150] L-1-3-->L54: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#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~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~nondet1#1=|v_ULTIMATE.start_main_#t~nondet1#1_1|, ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_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~pre6#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet1#1, ULTIMATE.start_main_#t~nondet2#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 119#[L54]don't care [93] L54-->L54-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] 122#[L54-1]don't care [113] L54-1-->L54-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] 125#[L54-2]don't care [102] L54-2-->L57: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet1#1=|v_ULTIMATE.start_main_#t~nondet1#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1#1] 128#[L57]don't care [155] L57-->L57-1: Formula: (= v_~x1~0_6 |v_ULTIMATE.start_main_#t~nondet1#1_3|) InVars {ULTIMATE.start_main_#t~nondet1#1=|v_ULTIMATE.start_main_#t~nondet1#1_3|} OutVars{~x1~0=v_~x1~0_6, ULTIMATE.start_main_#t~nondet1#1=|v_ULTIMATE.start_main_#t~nondet1#1_3|} AuxVars[] AssignedVars[~x1~0] 131#[L57-1]don't care [106] L57-1-->L58: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet1#1=|v_ULTIMATE.start_main_#t~nondet1#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1#1] 134#[L58]don't care [129] L58-->L58-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2#1] 137#[L58-1]don't care [101] L58-1-->L58-2: Formula: (= v_~x2~0_6 |v_ULTIMATE.start_main_#t~nondet2#1_3|) InVars {ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_3|} OutVars{~x2~0=v_~x2~0_6, ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_3|} AuxVars[] AssignedVars[~x2~0] 140#[L58-2]don't care [104] L58-2-->L59: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2#1] 143#[L59]don't care [125] L59-->L59-1: 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] 146#[L59-1]don't care [103] L59-1-->L59-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_3| v_~n~0_6) 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|, ~n~0=v_~n~0_6} AuxVars[] AssignedVars[~n~0] 149#[L59-2]don't care [144] L59-2-->L62: 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] 152#[L62]don't care [151] L62-->L62-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (let ((.cse0 (mod v_~x1~0_7 4294967296))) (and (= (mod v_~x2~0_7 4294967296) .cse0) (< 0 .cse0))) 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] 155#[L62-1]don't care [140] L62-1-->L31: 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] 158#[L31]don't care [99] L31-->L32: 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] 161#[L32]don't care [115] L32-->L31-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[] 167#[L31-1]don't care [154] L31-1-->L64: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 170#[L64]don't care [111] L64-->L64-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 173#[L64-1]don't care [146] 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) (= (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~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {#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_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#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_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 176#[L64-2]don't care [174] L64-2-->L38-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 182#[L38-1, L64-3]don't care [105] L64-3-->L64-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 196#[L38-1, L64-4]don't care [132] L64-4-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 216#[L65, L38-1]don't care [158] L65-->L65-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 245#[L38-1, L65-1]don't care [143] 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] 285#[L65-2, L38-1]don't care [130] 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~pre6#1_3|)) |v_#memory_int_5|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, 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|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, 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|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 338#[L65-3, L38-1]don't care [160] L38-1-->L39: Formula: (< (mod v_~x1~0_2 4294967296) (mod v_~n~0_2 4294967296)) InVars {~n~0=v_~n~0_2, ~x1~0=v_~x1~0_2} OutVars{~n~0=v_~n~0_2, ~x1~0=v_~x1~0_2} AuxVars[] AssignedVars[] 395#[L65-3, L39]don't care [177] L65-3-->L46-1: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 453#[L46-1, L39, L65-4]don't care [110] L65-4-->L65-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 535#[L65-5, L39, L46-1]don't care [116] L65-5-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 650#[L46-1, L39, L67]don't care [141] L67-->L67-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (not (= (mod v_~x1~0_8 4294967296) (mod v_~x2~0_8 4294967296))) 1 0)) 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] 870#[L39, L46-1, L67-1]don't care [117] L67-1-->L31-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] 1186#[L31-2, L46-1, L39]don't care [136] L31-2-->L32-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] 1541#[L39, L46-1, L32-3]don't care [119] L32-3-->L31-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[] 1976#[L46-1, L39, L31-3]don't care [100] L31-3-->L70: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] 2435#[L39, L46-1, L70]don't care [156] L70-->L54-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] 2933#[L46-1, L39, L54-3]don't care [139] L54-3-->L54-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] 3455#[L54-4, L39, L46-1]don't care [108] L54-4-->L54-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] 3996#[L54-5, L46-1, L39]don't care [148] L54-5-->L54-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] 4499#[L39, L46-1, L54-6]don't care [128] L54-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] 4922#[main_returnLabel#1, L46-1, L39]don't care [149] main_returnLabel#1-->ULTIMATE.startFINAL: Formula: (= |v_ULTIMATE.start_main_#res#1_3| |v_ULTIMATE.start_#t~ret8#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~ret8#1=|v_ULTIMATE.start_#t~ret8#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret8#1] 5329#[L39, L46-1, ULTIMATE.startFINAL]don't care [159] ULTIMATE.startFINAL-->ULTIMATE.startEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5738#[L46-1, L39, ULTIMATE.startEXIT]don't care [166] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[] 6156#[L39, ULTIMATE.startEXIT, L47]don't care [163] L39-->L38-1: Formula: (= v_~x1~0_3 (* v_~x1~0_4 2)) InVars {~x1~0=v_~x1~0_4} OutVars{~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~x1~0] 6543#[ULTIMATE.startEXIT, L38-1, L47]don't care [2023-09-17 11:32:29,494 INFO L750 eck$LassoCheckResult]: Loop: 6543#[ULTIMATE.startEXIT, L38-1, L47]don't care [169] L47-->L46-1: Formula: (= (* v_~x2~0_4 2) v_~x2~0_3) InVars {~x2~0=v_~x2~0_4} OutVars{~x2~0=v_~x2~0_3} AuxVars[] AssignedVars[~x2~0] 6715#[L46-1, ULTIMATE.startEXIT, L38-1]don't care [160] L38-1-->L39: Formula: (< (mod v_~x1~0_2 4294967296) (mod v_~n~0_2 4294967296)) InVars {~n~0=v_~n~0_2, ~x1~0=v_~x1~0_2} OutVars{~n~0=v_~n~0_2, ~x1~0=v_~x1~0_2} AuxVars[] AssignedVars[] 6935#[L46-1, L39, ULTIMATE.startEXIT]don't care [166] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[] 6156#[L39, ULTIMATE.startEXIT, L47]don't care [163] L39-->L38-1: Formula: (= v_~x1~0_3 (* v_~x1~0_4 2)) InVars {~x1~0=v_~x1~0_4} OutVars{~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~x1~0] 6543#[ULTIMATE.startEXIT, L38-1, L47]don't care [2023-09-17 11:32:29,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:32:29,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1185027730, now seen corresponding path program 1 times [2023-09-17 11:32:29,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:32:29,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362260161] [2023-09-17 11:32:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:32:29,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:32:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:32:29,786 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:32:29,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-17 11:32:29,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362260161] [2023-09-17 11:32:29,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362260161] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-17 11:32:29,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-17 11:32:29,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-17 11:32:29,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474016400] [2023-09-17 11:32:29,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-17 11:32:29,796 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-09-17 11:32:29,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:32:29,797 INFO L85 PathProgramCache]: Analyzing trace with hash 6117269, now seen corresponding path program 1 times [2023-09-17 11:32:29,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:32:29,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857228731] [2023-09-17 11:32:29,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:32:29,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:32:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:32:29,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:32:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:32:29,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:32:29,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-17 11:32:29,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-17 11:32:29,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-17 11:32:29,962 INFO L87 Difference]: Start difference. First operand null Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 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:32:30,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-17 11:32:30,041 INFO L93 Difference]: Finished difference Result 3113 states and 8782 transitions. [2023-09-17 11:32:30,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3113 states and 8782 transitions. [2023-09-17 11:32:30,083 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 11:32:30,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3113 states to 0 states and 0 transitions. [2023-09-17 11:32:30,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-17 11:32:30,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-17 11:32:30,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-17 11:32:30,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 11:32:30,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:32:30,089 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:32:30,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-17 11:32:30,094 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 11:32:30,094 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-17 11:32:30,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-09-17 11:32:30,095 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 11:32:30,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-09-17 11:32:30,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 11:32:30 BoogieIcfgContainer [2023-09-17 11:32:30,102 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-17 11:32:30,103 INFO L158 Benchmark]: Toolchain (without parser) took 1922.27ms. Allocated memory is still 275.8MB. Free memory was 228.6MB in the beginning and 96.2MB in the end (delta: 132.4MB). Peak memory consumption was 133.3MB. Max. memory is 8.0GB. [2023-09-17 11:32:30,103 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 11:32:30,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.90ms. Allocated memory is still 275.8MB. Free memory was 228.2MB in the beginning and 217.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-09-17 11:32:30,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.32ms. Allocated memory is still 275.8MB. Free memory was 217.7MB in the beginning and 216.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 11:32:30,107 INFO L158 Benchmark]: Boogie Preprocessor took 27.19ms. Allocated memory is still 275.8MB. Free memory was 216.4MB in the beginning and 215.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-17 11:32:30,108 INFO L158 Benchmark]: RCFGBuilder took 303.68ms. Allocated memory is still 275.8MB. Free memory was 215.0MB in the beginning and 203.0MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-09-17 11:32:30,111 INFO L158 Benchmark]: BuchiAutomizer took 1313.47ms. Allocated memory is still 275.8MB. Free memory was 203.0MB in the beginning and 96.2MB in the end (delta: 106.8MB). Peak memory consumption was 108.1MB. Max. memory is 8.0GB. [2023-09-17 11:32:30,116 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.12ms. Allocated memory is still 187.7MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.90ms. Allocated memory is still 275.8MB. Free memory was 228.2MB in the beginning and 217.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.32ms. Allocated memory is still 275.8MB. Free memory was 217.7MB in the beginning and 216.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.19ms. Allocated memory is still 275.8MB. Free memory was 216.4MB in the beginning and 215.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 303.68ms. Allocated memory is still 275.8MB. Free memory was 215.0MB in the beginning and 203.0MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 1313.47ms. Allocated memory is still 275.8MB. Free memory was 203.0MB in the beginning and 96.2MB in the end (delta: 106.8MB). Peak memory consumption was 108.1MB. 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 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic). 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 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 11:32:30,139 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...