/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/buchiAutomizer/concurrent-automaton-noLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:01:15,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:01:15,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:01:15,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:01:15,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:01:15,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:01:15,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:01:15,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:01:15,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:01:15,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:01:15,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:01:15,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:01:15,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:01:15,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:01:15,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:01:15,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:01:15,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:01:15,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:01:15,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:01:15,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:01:15,660 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:01:15,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:01:15,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:01:15,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:01:15,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:01:15,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:01:15,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:01:15,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:01:15,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:01:15,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:01:15,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:01:15,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:01:15,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:01:15,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:01:15,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:01:15,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:01:15,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:01:15,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:01:15,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:01:15,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:01:15,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:01:15,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:01:15,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2022-07-22 12:01:15,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:01:15,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:01:15,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:01:15,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:01:15,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:01:15,736 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:01:15,736 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:01:15,736 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:01:15,737 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:01:15,738 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:01:15,738 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:01:15,738 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:01:15,738 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:01:15,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:01:15,739 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:01:15,739 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:01:15,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:01:15,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:01:15,740 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:01:15,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:01:15,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:01:15,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:01:15,740 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:01:15,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:01:15,741 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:01:15,741 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:01:15,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:01:15,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:01:15,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:01:15,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:01:15,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:01:15,743 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 12:01:15,745 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:01:15,745 INFO L138 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 [2022-07-22 12:01:16,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:01:16,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:01:16,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:01:16,145 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:01:16,146 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:01:16,148 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2022-07-22 12:01:16,240 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eddca003/9de128cc3cdb45c186c2a19081c08026/FLAGa8729233f [2022-07-22 12:01:16,892 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:01:16,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2022-07-22 12:01:16,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eddca003/9de128cc3cdb45c186c2a19081c08026/FLAGa8729233f [2022-07-22 12:01:17,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eddca003/9de128cc3cdb45c186c2a19081c08026 [2022-07-22 12:01:17,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:01:17,297 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:01:17,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:01:17,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:01:17,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:01:17,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:01:17" (1/1) ... [2022-07-22 12:01:17,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4335d0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:17, skipping insertion in model container [2022-07-22 12:01:17,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:01:17" (1/1) ... [2022-07-22 12:01:17,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:01:17,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:01:17,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c[2438,2451] [2022-07-22 12:01:17,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:01:17,652 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:01:17,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c[2438,2451] [2022-07-22 12:01:17,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:01:17,728 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:01:17,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:17 WrapperNode [2022-07-22 12:01:17,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:01:17,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:01:17,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:01:17,731 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:01:17,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:17" (1/1) ... [2022-07-22 12:01:17,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:17" (1/1) ... [2022-07-22 12:01:17,793 INFO L137 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 125 [2022-07-22 12:01:17,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:01:17,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:01:17,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:01:17,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:01:17,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:17" (1/1) ... [2022-07-22 12:01:17,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:17" (1/1) ... [2022-07-22 12:01:17,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:17" (1/1) ... [2022-07-22 12:01:17,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:17" (1/1) ... [2022-07-22 12:01:17,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:17" (1/1) ... [2022-07-22 12:01:17,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:17" (1/1) ... [2022-07-22 12:01:17,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:17" (1/1) ... [2022-07-22 12:01:17,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:01:17,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:01:17,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:01:17,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:01:17,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:17" (1/1) ... [2022-07-22 12:01:17,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:17,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:17,873 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) [2022-07-22 12:01:17,901 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 [2022-07-22 12:01:17,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:01:17,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:01:17,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:01:17,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:01:17,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:01:17,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:01:17,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:01:17,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:01:17,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:01:17,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:01:17,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:01:17,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:01:17,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:01:17,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:01:17,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:01:17,947 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:01:18,042 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:01:18,045 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:01:18,450 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:01:18,573 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:01:18,577 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:01:18,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:01:18 BoogieIcfgContainer [2022-07-22 12:01:18,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:01:18,583 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:01:18,583 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:01:18,589 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:01:18,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:01:18,591 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:01:17" (1/3) ... [2022-07-22 12:01:18,592 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79e399a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:01:18, skipping insertion in model container [2022-07-22 12:01:18,592 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:01:18,593 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:01:17" (2/3) ... [2022-07-22 12:01:18,593 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79e399a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:01:18, skipping insertion in model container [2022-07-22 12:01:18,594 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:01:18,594 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:01:18" (3/3) ... [2022-07-22 12:01:18,595 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2022-07-22 12:01:18,751 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:01:18,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 118 transitions, 252 flow [2022-07-22 12:01:18,858 INFO L129 PetriNetUnfolder]: 9/114 cut-off events. [2022-07-22 12:01:18,858 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:01:18,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 114 events. 9/114 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-07-22 12:01:18,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 118 transitions, 252 flow [2022-07-22 12:01:18,870 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 114 transitions, 240 flow [2022-07-22 12:01:18,886 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:01:18,886 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:01:18,886 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:01:18,886 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:01:18,887 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:01:18,887 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:01:18,887 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:01:18,887 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:01:18,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:01:19,009 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 165 [2022-07-22 12:01:19,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:01:19,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:01:19,019 INFO L150 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] [2022-07-22 12:01:19,019 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:01:19,020 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:01:19,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 339 states, but on-demand construction may add more states [2022-07-22 12:01:19,042 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 165 [2022-07-22 12:01:19,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:01:19,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:01:19,044 INFO L150 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] [2022-07-22 12:01:19,044 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:01:19,052 INFO L748 eck$LassoCheckResult]: Stem: 117#[ULTIMATE.startENTRY]don't care [338] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 120#[L-1]don't care [261] L-1-->L-1-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] 122#[L-1-1]don't care [340] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] 124#[L-1-2]don't care [342] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 126#[L21]don't care [313] L21-->L21-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_4| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] 128#[L21-1]don't care [336] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_3| 1) 0) 48) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] 130#[L21-2]don't care [268] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_4| 1) 1) 0) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 132#[L21-3]don't care [302] L21-3-->L21-4: Formula: (and (= (select |v_#length_4| 2) 26) (= (select |v_#valid_5| 2) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 134#[L21-4]don't care [282] L21-4-->L42: Formula: (and (= v_~queue~0.offset_3 0) (= v_~queue~0.base_3 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_3, ~queue~0.offset=v_~queue~0.offset_3} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 136#[L42]don't care [274] L42-->L42-1: Formula: (= v_~front~0_5 0) InVars {} OutVars{~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0] 138#[L42-1]don't care [337] L42-1-->L42-2: Formula: (= v_~back~0_6 0) InVars {} OutVars{~back~0=v_~back~0_6} AuxVars[] AssignedVars[~back~0] 140#[L42-2]don't care [280] L42-2-->L42-3: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0] 142#[L42-3]don't care [252] L42-3-->L-1-3: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 144#[L-1-3]don't care [345] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 146#[L-1-4]don't care [266] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 148#[L-1-5]don't care [248] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 150#[L-1-6]don't care [331] L-1-6-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_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_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 152#[L71]don't care [291] L71-->L71-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, 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_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 154#[L71-1]don't care [251] L71-1-->L71-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 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_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, 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_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 156#[L71-2]don't care [341] L71-2-->L74: Formula: (= 5 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 158#[L74]don't care [290] L74-->L74-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_2| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[~n~0] 160#[L74-1]don't care [315] L74-1-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 162#[L75]don't care [277] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~front~0_6) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~front~0] 164#[L75-1]don't care [255] L75-1-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 166#[L76]don't care [285] L76-->L77: Formula: (= v_~back~0_7 v_~front~0_7) InVars {~front~0=v_~front~0_7} OutVars{~back~0=v_~back~0_7, ~front~0=v_~front~0_7} AuxVars[] AssignedVars[~back~0] 168#[L77]don't care [294] L77-->L77-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 170#[L77-1]don't care [305] L77-1-->L77-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 172#[L77-2]don't care [264] L77-2-->L77-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 174#[L77-3]don't care [296] L77-3-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 176#[L91]don't care [253] L91-->L92: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 178#[L92]don't care [329] L92-->L92-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 180#[L92-1]don't care [319] L92-1-->L92-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, 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] 182#[L92-2]don't care [278] L92-2-->L37: 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] 184#[L37]don't care [275] L37-->L38: 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] 186#[L38]don't care [284] L38-->L37-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[] 190#[L37-1]don't care [276] L37-1-->L93: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 192#[L93]don't care [257] L93-->L93-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 194#[L93-1]don't care [332] L93-1-->L93-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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] 196#[L93-2]don't care [314] L93-2-->L37-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] 198#[L37-2]don't care [249] L37-2-->L38-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] 200#[L38-3]don't care [259] L38-3-->L37-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[] 204#[L37-3]don't care [256] L37-3-->L95: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 206#[L95]don't care [306] L95-->L95-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 208#[L95-1]don't care [317] L95-1-->L95-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 210#[L95-2]don't care [318] L95-2-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 212#[L96]don't care [330] L96-->L96-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 214#[L96-6]don't care [2022-07-22 12:01:19,053 INFO L750 eck$LassoCheckResult]: Loop: 214#[L96-6]don't care [241] L96-6-->L97: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 218#[L97]don't care [292] L97-->L97-1: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0 4) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|)) |v_#memory_int_5|) (<= 0 .cse1) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int] 222#[L97-1]don't care [301] L97-1-->L96-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 226#[L96-3]don't care [262] L96-3-->L96-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 230#[L96-4]don't care [307] L96-4-->L96-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 234#[L96-5]don't care [320] L96-5-->L96-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 214#[L96-6]don't care [2022-07-22 12:01:19,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:19,064 INFO L85 PathProgramCache]: Analyzing trace with hash -582107988, now seen corresponding path program 1 times [2022-07-22 12:01:19,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:19,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531790261] [2022-07-22 12:01:19,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:19,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:19,223 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:19,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:19,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:19,311 INFO L85 PathProgramCache]: Analyzing trace with hash -523908678, now seen corresponding path program 1 times [2022-07-22 12:01:19,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:19,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658918687] [2022-07-22 12:01:19,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:19,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:19,347 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:19,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:19,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:19,371 INFO L85 PathProgramCache]: Analyzing trace with hash 966793765, now seen corresponding path program 1 times [2022-07-22 12:01:19,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:19,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977225871] [2022-07-22 12:01:19,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:19,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:19,442 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:19,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:20,736 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:01:20,737 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:01:20,737 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:01:20,737 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:01:20,738 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:01:20,738 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:20,738 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:01:20,738 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:01:20,738 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-simple-queue.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:01:20,738 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:01:20,739 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:01:20,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:20,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:20,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:20,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:20,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:20,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:20,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:20,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:20,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:21,568 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:01:21,573 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:01:21,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:21,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:21,577 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) [2022-07-22 12:01:21,590 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 [2022-07-22 12:01:21,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:21,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:01:21,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:21,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:21,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:21,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:01:21,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:01:21,605 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 [2022-07-22 12:01:21,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:21,653 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 [2022-07-22 12:01:21,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:21,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:21,656 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) [2022-07-22 12:01:21,660 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 [2022-07-22 12:01:21,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:21,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:21,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:21,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:21,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:21,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:21,680 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 [2022-07-22 12:01:21,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:21,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:21,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:21,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:21,725 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) [2022-07-22 12:01:21,729 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 [2022-07-22 12:01:21,730 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 [2022-07-22 12:01:21,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:21,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:21,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:21,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:21,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:21,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:21,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:21,789 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 [2022-07-22 12:01:21,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:21,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:21,791 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) [2022-07-22 12:01:21,795 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 [2022-07-22 12:01:21,797 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 [2022-07-22 12:01:21,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:21,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:01:21,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:21,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:21,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:21,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:01:21,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:01:21,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:21,856 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 [2022-07-22 12:01:21,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:21,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:21,860 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) [2022-07-22 12:01:21,866 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 [2022-07-22 12:01:21,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:21,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:01:21,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:21,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:21,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:21,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:01:21,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:01:21,879 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 [2022-07-22 12:01:21,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:21,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:21,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:21,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:21,932 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) [2022-07-22 12:01:21,937 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 [2022-07-22 12:01:21,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:21,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:21,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:21,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:21,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:21,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:21,958 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 [2022-07-22 12:01:21,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:22,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:22,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:22,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:22,003 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:01:22,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 12:01:22,008 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 [2022-07-22 12:01:22,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:22,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:22,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:22,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:22,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:22,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:22,038 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:22,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:22,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:22,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:22,075 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:01:22,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 12:01:22,077 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 [2022-07-22 12:01:22,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:22,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:22,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:22,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:22,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:22,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:22,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:22,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:22,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:22,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:22,133 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:01:22,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 12:01:22,135 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 [2022-07-22 12:01:22,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:22,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:22,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:22,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:22,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:22,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:22,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:22,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:22,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:22,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:22,202 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:01:22,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:01:22,206 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 [2022-07-22 12:01:22,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:22,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:22,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:22,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:22,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:22,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:22,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:22,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:22,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:22,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:22,258 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:01:22,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:01:22,259 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 [2022-07-22 12:01:22,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:22,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:22,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:22,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:22,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:22,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:22,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:22,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:22,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:22,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:22,316 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:01:22,360 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 [2022-07-22 12:01:22,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:22,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:22,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:22,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:22,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:22,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:22,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:01:22,395 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:01:22,430 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-22 12:01:22,430 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-22 12:01:22,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:22,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:22,434 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:01:22,439 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:01:22,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:01:22,462 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:01:22,462 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:01:22,463 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~0#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:01:22,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:22,598 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:01:22,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:01:22,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:01:22,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:01:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:01:22,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:01:22,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:01:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:01:22,860 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 12:01:22,864 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 339 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) [2022-07-22 12:01:22,978 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 339 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 657 states and 1612 transitions. Complement of second has 8 states. [2022-07-22 12:01:22,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 12:01:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) [2022-07-22 12:01:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2022-07-22 12:01:22,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 133 transitions. Stem has 46 letters. Loop has 6 letters. [2022-07-22 12:01:22,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:01:22,992 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:01:23,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:01:23,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:01:23,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:01:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:01:23,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:01:23,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:01:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:01:23,139 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 12:01:23,139 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 339 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) [2022-07-22 12:01:23,217 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 339 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 651 states and 1605 transitions. Complement of second has 10 states. [2022-07-22 12:01:23,218 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 [2022-07-22 12:01:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) [2022-07-22 12:01:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2022-07-22 12:01:23,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 134 transitions. Stem has 46 letters. Loop has 6 letters. [2022-07-22 12:01:23,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:01:23,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 134 transitions. Stem has 52 letters. Loop has 6 letters. [2022-07-22 12:01:23,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:01:23,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 134 transitions. Stem has 46 letters. Loop has 12 letters. [2022-07-22 12:01:23,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:01:23,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 651 states and 1605 transitions. [2022-07-22 12:01:23,237 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 159 [2022-07-22 12:01:23,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 651 states to 245 states and 559 transitions. [2022-07-22 12:01:23,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2022-07-22 12:01:23,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2022-07-22 12:01:23,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 559 transitions. [2022-07-22 12:01:23,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:01:23,253 INFO L220 hiAutomatonCegarLoop]: Abstraction has 245 states and 559 transitions. [2022-07-22 12:01:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 559 transitions. [2022-07-22 12:01:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2022-07-22 12:01:23,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 245 states have (on average 2.2816326530612243) internal successors, (559), 244 states have internal predecessors, (559), 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) [2022-07-22 12:01:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 559 transitions. [2022-07-22 12:01:23,304 INFO L242 hiAutomatonCegarLoop]: Abstraction has 245 states and 559 transitions. [2022-07-22 12:01:23,304 INFO L425 stractBuchiCegarLoop]: Abstraction has 245 states and 559 transitions. [2022-07-22 12:01:23,304 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:01:23,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 559 transitions. [2022-07-22 12:01:23,307 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 159 [2022-07-22 12:01:23,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:01:23,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:01:23,309 INFO L150 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, 1, 1] [2022-07-22 12:01:23,309 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:01:23,311 INFO L748 eck$LassoCheckResult]: Stem: 3003#[ULTIMATE.startENTRY]don't care [338] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2985#[L-1]don't care [261] L-1-->L-1-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] 2987#[L-1-1]don't care [340] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] 3005#[L-1-2]don't care [342] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 2843#[L21]don't care [313] L21-->L21-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_4| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] 2845#[L21-1]don't care [336] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_3| 1) 0) 48) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] 2991#[L21-2]don't care [268] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_4| 1) 1) 0) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 2993#[L21-3]don't care [302] L21-3-->L21-4: Formula: (and (= (select |v_#length_4| 2) 26) (= (select |v_#valid_5| 2) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 2749#[L21-4]don't care [282] L21-4-->L42: Formula: (and (= v_~queue~0.offset_3 0) (= v_~queue~0.base_3 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_3, ~queue~0.offset=v_~queue~0.offset_3} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 2731#[L42]don't care [274] L42-->L42-1: Formula: (= v_~front~0_5 0) InVars {} OutVars{~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0] 2733#[L42-1]don't care [337] L42-1-->L42-2: Formula: (= v_~back~0_6 0) InVars {} OutVars{~back~0=v_~back~0_6} AuxVars[] AssignedVars[~back~0] 2997#[L42-2]don't care [280] L42-2-->L42-3: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0] 2957#[L42-3]don't care [252] L42-3-->L-1-3: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 2959#[L-1-3]don't care [345] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2707#[L-1-4]don't care [266] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2709#[L-1-5]don't care [248] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 2947#[L-1-6]don't care [331] L-1-6-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_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_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 2779#[L71]don't care [291] L71-->L71-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, 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_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 2781#[L71-1]don't care [251] L71-1-->L71-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 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_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, 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_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 2903#[L71-2]don't care [341] L71-2-->L74: Formula: (= 5 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 2905#[L74]don't care [290] L74-->L74-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_2| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[~n~0] 2853#[L74-1]don't care [315] L74-1-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 2855#[L75]don't care [277] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~front~0_6) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~front~0] 2973#[L75-1]don't care [255] L75-1-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 2757#[L76]don't care [285] L76-->L77: Formula: (= v_~back~0_7 v_~front~0_7) InVars {~front~0=v_~front~0_7} OutVars{~back~0=v_~back~0_7, ~front~0=v_~front~0_7} AuxVars[] AssignedVars[~back~0] 2759#[L77]don't care [294] L77-->L77-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2827#[L77-1]don't care [305] L77-1-->L77-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 2829#[L77-2]don't care [264] L77-2-->L77-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 2801#[L77-3]don't care [296] L77-3-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 2803#[L91]don't care [253] L91-->L92: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 2887#[L92]don't care [329] L92-->L92-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2869#[L92-1]don't care [319] L92-1-->L92-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, 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] 2871#[L92-2]don't care [278] L92-2-->L37: 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] 2737#[L37]don't care [275] L37-->L38: 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] 2739#[L38]don't care [284] L38-->L37-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[] 2995#[L37-1]don't care [276] L37-1-->L93: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2675#[L93]don't care [257] L93-->L93-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2677#[L93-1]don't care [332] L93-1-->L93-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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] 2849#[L93-2]don't care [314] L93-2-->L37-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] 2851#[L37-2]don't care [249] L37-2-->L38-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] 2679#[L38-3]don't care [259] L38-3-->L37-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[] 2657#[L37-3]don't care [256] L37-3-->L95: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2659#[L95]don't care [306] L95-->L95-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 2865#[L95-1]don't care [317] L95-1-->L95-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 2861#[L95-2]don't care [318] L95-2-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 2863#[L96]don't care [330] L96-->L96-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 2935#[L96-6]don't care [240] L96-6-->L96-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 2797#[L96-7]don't care [295] L96-7-->L99: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 2799#[L99]don't care [325] L99-->L77-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 2879#[L77-4]don't care [326] L77-4-->L77-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2881#[L77-5]don't care [246] L77-5-->L77-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret9#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret9#1.base_3| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 2571#[L77-6]don't care [242] L77-6-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 2573#[L80]don't care [238] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 2933#[L80-1]don't care [334] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 2621#[L80-2]don't care [250] L80-2-->L80-3: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_7|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, 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~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, 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] 2623#[L80-3]don't care [364] L80-3-->L52: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1, thread1Thread1of1ForFork0_#res#1.base] 2825#[L52, L80-4]don't care [2022-07-22 12:01:23,311 INFO L750 eck$LassoCheckResult]: Loop: 2825#[L52, L80-4]don't care [348] L52-->L47-2: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_3| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[] 2875#[L47-2, L80-4]don't care [351] L47-2-->L48: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1#1] 2981#[L80-4, L48]don't care [353] L48-->L52: Formula: (let ((.cse1 (* 4 v_~back~0_51))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_27))) (and (= (select |v_#valid_43| v_~queue~0.base_27) 1) (= (ite (= 5 (select (select |v_#memory_int_35| v_~queue~0.base_27) .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= (+ v_~back~0_51 1) v_~back~0_50) (<= (+ .cse1 4 v_~queue~0.offset_27) (select |v_#length_38| v_~queue~0.base_27)) (not (= (ite (and (<= 0 v_~back~0_51) (< v_~back~0_51 v_~n~0_24)) 1 0) 0)) (<= 0 .cse0)))) InVars {~queue~0.offset=v_~queue~0.offset_27, #valid=|v_#valid_43|, ~back~0=v_~back~0_51, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_24} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~queue~0.offset=v_~queue~0.offset_27, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_1|, #valid=|v_#valid_43|, ~back~0=v_~back~0_50, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, #length=|v_#length_38|, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] 2825#[L52, L80-4]don't care [2022-07-22 12:01:23,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:23,312 INFO L85 PathProgramCache]: Analyzing trace with hash 759811922, now seen corresponding path program 1 times [2022-07-22 12:01:23,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:23,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189053953] [2022-07-22 12:01:23,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:23,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:23,350 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:23,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:23,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:23,390 INFO L85 PathProgramCache]: Analyzing trace with hash 375453, now seen corresponding path program 1 times [2022-07-22 12:01:23,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:23,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348207140] [2022-07-22 12:01:23,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:23,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:23,400 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:23,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:23,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:23,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1079664044, now seen corresponding path program 1 times [2022-07-22 12:01:23,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:23,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646242948] [2022-07-22 12:01:23,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:23,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:01:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:01:23,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:01:23,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646242948] [2022-07-22 12:01:23,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646242948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:01:23,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:01:23,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 12:01:23,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950064160] [2022-07-22 12:01:23,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:01:23,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:01:23,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 12:01:23,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 12:01:23,690 INFO L87 Difference]: Start difference. First operand 245 states and 559 transitions. cyclomatic complexity: 360 Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 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) [2022-07-22 12:01:23,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:01:23,802 INFO L93 Difference]: Finished difference Result 441 states and 942 transitions. [2022-07-22 12:01:23,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 441 states and 942 transitions. [2022-07-22 12:01:23,809 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 159 [2022-07-22 12:01:23,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 441 states to 249 states and 532 transitions. [2022-07-22 12:01:23,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2022-07-22 12:01:23,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2022-07-22 12:01:23,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 249 states and 532 transitions. [2022-07-22 12:01:23,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:01:23,816 INFO L220 hiAutomatonCegarLoop]: Abstraction has 249 states and 532 transitions. [2022-07-22 12:01:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 532 transitions. [2022-07-22 12:01:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 245. [2022-07-22 12:01:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 245 states have (on average 2.1551020408163266) internal successors, (528), 244 states have internal predecessors, (528), 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) [2022-07-22 12:01:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 528 transitions. [2022-07-22 12:01:23,832 INFO L242 hiAutomatonCegarLoop]: Abstraction has 245 states and 528 transitions. [2022-07-22 12:01:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 12:01:23,834 INFO L425 stractBuchiCegarLoop]: Abstraction has 245 states and 528 transitions. [2022-07-22 12:01:23,834 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:01:23,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 528 transitions. [2022-07-22 12:01:23,837 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 159 [2022-07-22 12:01:23,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:01:23,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:01:23,839 INFO L150 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:01:23,839 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:01:23,840 INFO L748 eck$LassoCheckResult]: Stem: 3951#[ULTIMATE.startENTRY]don't care [338] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3933#[L-1]don't care [261] L-1-->L-1-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] 3935#[L-1-1]don't care [340] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] 3953#[L-1-2]don't care [342] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 3779#[L21]don't care [313] L21-->L21-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_4| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] 3781#[L21-1]don't care [336] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_3| 1) 0) 48) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] 3939#[L21-2]don't care [268] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_4| 1) 1) 0) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 3941#[L21-3]don't care [302] L21-3-->L21-4: Formula: (and (= (select |v_#length_4| 2) 26) (= (select |v_#valid_5| 2) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 3689#[L21-4]don't care [282] L21-4-->L42: Formula: (and (= v_~queue~0.offset_3 0) (= v_~queue~0.base_3 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_3, ~queue~0.offset=v_~queue~0.offset_3} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 3671#[L42]don't care [274] L42-->L42-1: Formula: (= v_~front~0_5 0) InVars {} OutVars{~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0] 3673#[L42-1]don't care [337] L42-1-->L42-2: Formula: (= v_~back~0_6 0) InVars {} OutVars{~back~0=v_~back~0_6} AuxVars[] AssignedVars[~back~0] 3945#[L42-2]don't care [280] L42-2-->L42-3: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0] 3905#[L42-3]don't care [252] L42-3-->L-1-3: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 3907#[L-1-3]don't care [345] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3649#[L-1-4]don't care [266] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3651#[L-1-5]don't care [248] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 3893#[L-1-6]don't care [331] L-1-6-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_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_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 3719#[L71]don't care [291] L71-->L71-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, 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_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 3721#[L71-1]don't care [251] L71-1-->L71-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 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_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, 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_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 3847#[L71-2]don't care [341] L71-2-->L74: Formula: (= 5 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 3849#[L74]don't care [290] L74-->L74-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_2| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[~n~0] 3793#[L74-1]don't care [315] L74-1-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 3795#[L75]don't care [277] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~front~0_6) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~front~0] 3921#[L75-1]don't care [255] L75-1-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 3697#[L76]don't care [285] L76-->L77: Formula: (= v_~back~0_7 v_~front~0_7) InVars {~front~0=v_~front~0_7} OutVars{~back~0=v_~back~0_7, ~front~0=v_~front~0_7} AuxVars[] AssignedVars[~back~0] 3699#[L77]don't care [294] L77-->L77-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3767#[L77-1]don't care [305] L77-1-->L77-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 3769#[L77-2]don't care [264] L77-2-->L77-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 3741#[L77-3]don't care [296] L77-3-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 3743#[L91]don't care [253] L91-->L92: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 3833#[L92]don't care [329] L92-->L92-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3811#[L92-1]don't care [319] L92-1-->L92-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, 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] 3813#[L92-2]don't care [278] L92-2-->L37: 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] 3675#[L37]don't care [275] L37-->L38: 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] 3677#[L38]don't care [284] L38-->L37-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[] 3943#[L37-1]don't care [276] L37-1-->L93: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3619#[L93]don't care [257] L93-->L93-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3621#[L93-1]don't care [332] L93-1-->L93-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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] 3789#[L93-2]don't care [314] L93-2-->L37-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] 3791#[L37-2]don't care [249] L37-2-->L38-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] 3623#[L38-3]don't care [259] L38-3-->L37-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[] 3605#[L37-3]don't care [256] L37-3-->L95: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3607#[L95]don't care [306] L95-->L95-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 3807#[L95-1]don't care [317] L95-1-->L95-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 3803#[L95-2]don't care [318] L95-2-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 3805#[L96]don't care [330] L96-->L96-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 3881#[L96-6]don't care [241] L96-6-->L97: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 3883#[L97]don't care [292] L97-->L97-1: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0 4) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|)) |v_#memory_int_5|) (<= 0 .cse1) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int] 3947#[L97-1]don't care [301] L97-1-->L96-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 3629#[L96-3]don't care [262] L96-3-->L96-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 3631#[L96-4]don't care [307] L96-4-->L96-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 3949#[L96-5]don't care [320] L96-5-->L96-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 3885#[L96-6]don't care [240] L96-6-->L96-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 3737#[L96-7]don't care [295] L96-7-->L99: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 3739#[L99]don't care [325] L99-->L77-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 3823#[L77-4]don't care [326] L77-4-->L77-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3825#[L77-5]don't care [246] L77-5-->L77-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret9#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret9#1.base_3| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 3519#[L77-6]don't care [242] L77-6-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 3521#[L80]don't care [238] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 3879#[L80-1]don't care [334] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 3565#[L80-2]don't care [250] L80-2-->L80-3: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_7|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, 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~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, 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] 3567#[L80-3]don't care [364] L80-3-->L52: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1, thread1Thread1of1ForFork0_#res#1.base] 3761#[L52, L80-4]don't care [2022-07-22 12:01:23,841 INFO L750 eck$LassoCheckResult]: Loop: 3761#[L52, L80-4]don't care [348] L52-->L47-2: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_3| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[] 3817#[L47-2, L80-4]don't care [351] L47-2-->L48: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1#1] 3931#[L80-4, L48]don't care [353] L48-->L52: Formula: (let ((.cse1 (* 4 v_~back~0_51))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_27))) (and (= (select |v_#valid_43| v_~queue~0.base_27) 1) (= (ite (= 5 (select (select |v_#memory_int_35| v_~queue~0.base_27) .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= (+ v_~back~0_51 1) v_~back~0_50) (<= (+ .cse1 4 v_~queue~0.offset_27) (select |v_#length_38| v_~queue~0.base_27)) (not (= (ite (and (<= 0 v_~back~0_51) (< v_~back~0_51 v_~n~0_24)) 1 0) 0)) (<= 0 .cse0)))) InVars {~queue~0.offset=v_~queue~0.offset_27, #valid=|v_#valid_43|, ~back~0=v_~back~0_51, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_24} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~queue~0.offset=v_~queue~0.offset_27, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_1|, #valid=|v_#valid_43|, ~back~0=v_~back~0_50, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, #length=|v_#length_38|, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] 3761#[L52, L80-4]don't care [2022-07-22 12:01:23,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:23,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1076128139, now seen corresponding path program 1 times [2022-07-22 12:01:23,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:23,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788099161] [2022-07-22 12:01:23,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:23,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:23,874 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:23,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:23,950 INFO L85 PathProgramCache]: Analyzing trace with hash 375453, now seen corresponding path program 2 times [2022-07-22 12:01:23,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:23,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614923229] [2022-07-22 12:01:23,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:23,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:23,965 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:23,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:23,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:23,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1297837267, now seen corresponding path program 1 times [2022-07-22 12:01:23,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:23,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295828600] [2022-07-22 12:01:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:23,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:24,088 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:24,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:24,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:25,729 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:01:25,730 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:01:25,730 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:01:25,730 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:01:25,730 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:01:25,730 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:25,730 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:01:25,730 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:01:25,731 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-simple-queue.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:01:25,731 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:01:25,731 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:01:25,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:26,876 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:01:26,876 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:01:26,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:26,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:26,889 INFO L229 MonitoredProcess]: Starting monitored process 15 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) [2022-07-22 12:01:26,897 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 [2022-07-22 12:01:26,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:26,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:01:26,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:26,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:26,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:26,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:01:26,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:01:26,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:01:26,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:26,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-22 12:01:26,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:26,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:26,946 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2022-07-22 12:01:26,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:01:26,949 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 [2022-07-22 12:01:26,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:26,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:26,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:26,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:26,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:26,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:26,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:27,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:27,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:27,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:27,020 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2022-07-22 12:01:27,027 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 [2022-07-22 12:01:27,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:27,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:27,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:27,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:27,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:27,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:27,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:01:27,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:27,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:27,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:27,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:27,088 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2022-07-22 12:01:27,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:01:27,091 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 [2022-07-22 12:01:27,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:27,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:27,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:27,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:27,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:27,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:27,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:01:27,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:01:27,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:27,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:27,128 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2022-07-22 12:01:27,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:01:27,129 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 [2022-07-22 12:01:27,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:01:27,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:01:27,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:01:27,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:01:27,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:01:27,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:01:27,168 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:01:27,199 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-07-22 12:01:27,199 INFO L444 ModelExtractionUtils]: 24 out of 37 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-22 12:01:27,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:27,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:01:27,201 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2022-07-22 12:01:27,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:01:27,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:01:27,236 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 12:01:27,236 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:01:27,237 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~back~0, v_rep(select #length ~queue~0.base)_1) = -2*~back~0 + 1*v_rep(select #length ~queue~0.base)_1 Supporting invariants [1*~queue~0.offset >= 0] [2022-07-22 12:01:27,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-07-22 12:01:27,374 INFO L257 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2022-07-22 12:01:27,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:01:27,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 12:01:27,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:01:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:01:27,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 12:01:27,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:01:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:01:27,583 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2022-07-22 12:01:27,584 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 245 states and 528 transitions. cyclomatic complexity: 329 Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 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) [2022-07-22 12:01:27,744 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 245 states and 528 transitions. cyclomatic complexity: 329. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 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 543 states and 1404 transitions. Complement of second has 10 states. [2022-07-22 12:01:27,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 7 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:01:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 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) [2022-07-22 12:01:27,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2022-07-22 12:01:27,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 106 transitions. Stem has 62 letters. Loop has 3 letters. [2022-07-22 12:01:27,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:01:27,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 106 transitions. Stem has 65 letters. Loop has 3 letters. [2022-07-22 12:01:27,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:01:27,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 106 transitions. Stem has 62 letters. Loop has 6 letters. [2022-07-22 12:01:27,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:01:27,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 543 states and 1404 transitions. [2022-07-22 12:01:27,755 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 93 [2022-07-22 12:01:27,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 543 states to 318 states and 764 transitions. [2022-07-22 12:01:27,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2022-07-22 12:01:27,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2022-07-22 12:01:27,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 764 transitions. [2022-07-22 12:01:27,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:01:27,762 INFO L220 hiAutomatonCegarLoop]: Abstraction has 318 states and 764 transitions. [2022-07-22 12:01:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 764 transitions. [2022-07-22 12:01:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 268. [2022-07-22 12:01:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 268 states have (on average 2.3171641791044775) internal successors, (621), 267 states have internal predecessors, (621), 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) [2022-07-22 12:01:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 621 transitions. [2022-07-22 12:01:27,776 INFO L242 hiAutomatonCegarLoop]: Abstraction has 268 states and 621 transitions. [2022-07-22 12:01:27,776 INFO L425 stractBuchiCegarLoop]: Abstraction has 268 states and 621 transitions. [2022-07-22 12:01:27,776 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:01:27,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 268 states and 621 transitions. [2022-07-22 12:01:27,779 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 93 [2022-07-22 12:01:27,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:01:27,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:01:27,811 INFO L150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:01:27,811 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:01:27,822 INFO L748 eck$LassoCheckResult]: Stem: 5369#[ULTIMATE.startENTRY]don't care [338] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5337#[L-1]don't care [261] L-1-->L-1-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] 5339#[L-1-1]don't care [340] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] 5371#[L-1-2]don't care [342] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 5159#[L21]don't care [313] L21-->L21-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_4| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] 5161#[L21-1]don't care [336] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_3| 1) 0) 48) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] 5347#[L21-2]don't care [268] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_4| 1) 1) 0) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 5349#[L21-3]don't care [302] L21-3-->L21-4: Formula: (and (= (select |v_#length_4| 2) 26) (= (select |v_#valid_5| 2) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 5071#[L21-4]don't care [282] L21-4-->L42: Formula: (and (= v_~queue~0.offset_3 0) (= v_~queue~0.base_3 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_3, ~queue~0.offset=v_~queue~0.offset_3} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 5051#[L42]don't care [274] L42-->L42-1: Formula: (= v_~front~0_5 0) InVars {} OutVars{~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0] 5053#[L42-1]don't care [337] L42-1-->L42-2: Formula: (= v_~back~0_6 0) InVars {} OutVars{~back~0=v_~back~0_6} AuxVars[] AssignedVars[~back~0] 5353#[L42-2]don't care [280] L42-2-->L42-3: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0] 5303#[L42-3]don't care [252] L42-3-->L-1-3: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 5305#[L-1-3]don't care [345] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5025#[L-1-4]don't care [266] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5027#[L-1-5]don't care [248] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 5289#[L-1-6]don't care [331] L-1-6-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_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_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 5105#[L71]don't care [291] L71-->L71-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, 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_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 5107#[L71-1]don't care [251] L71-1-->L71-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 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_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, 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_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 5219#[L71-2]don't care [341] L71-2-->L74: Formula: (= 5 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 5221#[L74]don't care [290] L74-->L74-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_2| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[~n~0] 5167#[L74-1]don't care [315] L74-1-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 5169#[L75]don't care [277] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~front~0_6) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~front~0] 5317#[L75-1]don't care [255] L75-1-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 5083#[L76]don't care [285] L76-->L77: Formula: (= v_~back~0_7 v_~front~0_7) InVars {~front~0=v_~front~0_7} OutVars{~back~0=v_~back~0_7, ~front~0=v_~front~0_7} AuxVars[] AssignedVars[~back~0] 5085#[L77]don't care [294] L77-->L77-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5141#[L77-1]don't care [305] L77-1-->L77-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 5143#[L77-2]don't care [264] L77-2-->L77-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 5121#[L77-3]don't care [296] L77-3-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 5123#[L91]don't care [253] L91-->L92: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 5203#[L92]don't care [329] L92-->L92-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5177#[L92-1]don't care [319] L92-1-->L92-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, 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] 5179#[L92-2]don't care [278] L92-2-->L37: 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] 5057#[L37]don't care [275] L37-->L38: 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] 5059#[L38]don't care [284] L38-->L37-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[] 5351#[L37-1]don't care [276] L37-1-->L93: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4999#[L93]don't care [257] L93-->L93-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5001#[L93-1]don't care [332] L93-1-->L93-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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] 5163#[L93-2]don't care [314] L93-2-->L37-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] 5165#[L37-2]don't care [249] L37-2-->L38-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] 5003#[L38-3]don't care [259] L38-3-->L37-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[] 4983#[L37-3]don't care [256] L37-3-->L95: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4985#[L95]don't care [306] L95-->L95-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 5171#[L95-1]don't care [317] L95-1-->L95-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 5173#[L95-2]don't care [318] L95-2-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 5175#[L96]don't care [330] L96-->L96-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 5261#[L96-6]don't care [241] L96-6-->L97: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 5263#[L97]don't care [292] L97-->L97-1: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0 4) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|)) |v_#memory_int_5|) (<= 0 .cse1) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int] 5357#[L97-1]don't care [301] L97-1-->L96-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 5005#[L96-3]don't care [262] L96-3-->L96-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 5007#[L96-4]don't care [307] L96-4-->L96-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 5363#[L96-5]don't care [320] L96-5-->L96-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 5265#[L96-6]don't care [240] L96-6-->L96-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 5117#[L96-7]don't care [295] L96-7-->L99: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 5119#[L99]don't care [325] L99-->L77-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 5193#[L77-4]don't care [326] L77-4-->L77-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5195#[L77-5]don't care [246] L77-5-->L77-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret9#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret9#1.base_3| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 4899#[L77-6]don't care [242] L77-6-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 4901#[L80]don't care [238] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 5259#[L80-1]don't care [334] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 4941#[L80-2]don't care [250] L80-2-->L80-3: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_7|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, 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~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, 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] 4943#[L80-3]don't care [364] L80-3-->L52: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1, thread1Thread1of1ForFork0_#res#1.base] 5139#[L52, L80-4]don't care [273] L80-4-->L80-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 4927#[L52, L80-5]don't care [324] L80-5-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 4929#[L52, L81]don't care [339] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 4945#[L52, L81-1]don't care [235] L81-1-->L81-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 4949#[L52, L81-2]don't care [310] L81-2-->L81-3: Formula: (and (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_13| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre12#1_3|)) |v_#memory_int_9|)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 5267#[L52, L81-3]don't care [367] L81-3-->L64: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_4|, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_10|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~nondet4#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 5269#[L64, L81-4, L52]don't care [2022-07-22 12:01:27,823 INFO L750 eck$LassoCheckResult]: Loop: 5269#[L64, L81-4, L52]don't care [356] L64-->L59-2: Formula: (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_3| 256) 0)) InVars {thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_3|} AuxVars[] AssignedVars[] 5321#[L59-2, L81-4, L52]don't care [359] L59-2-->L60: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet4#1] 5341#[L60, L81-4, L52]don't care [361] L60-->L64: Formula: (let ((.cse1 (* v_~front~0_35 4))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_31))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (<= 0 .cse0) (= (ite (and (< v_~front~0_35 v_~n~0_26) (< v_~front~0_35 v_~back~0_54) (<= 0 v_~front~0_35)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= v_~x~0_19 (select (select |v_#memory_int_39| v_~queue~0.base_31) .cse0)) (= (select |v_#valid_47| v_~queue~0.base_31) 1) (<= (+ .cse1 4 v_~queue~0.offset_31) (select |v_#length_42| v_~queue~0.base_31)) (= v_~front~0_34 (+ v_~front~0_35 1))))) InVars {~queue~0.offset=v_~queue~0.offset_31, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_39|, ~back~0=v_~back~0_54, #length=|v_#length_42|, ~queue~0.base=v_~queue~0.base_31, ~n~0=v_~n~0_26, ~front~0=v_~front~0_35} OutVars{~queue~0.offset=v_~queue~0.offset_31, ~back~0=v_~back~0_54, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~queue~0.base=v_~queue~0.base_31, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_39|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, #length=|v_#length_42|, ~n~0=v_~n~0_26, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_1|, ~x~0=v_~x~0_19, ~front~0=v_~front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, ~x~0, ~front~0] 5269#[L64, L81-4, L52]don't care [2022-07-22 12:01:27,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1597880049, now seen corresponding path program 1 times [2022-07-22 12:01:27,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:27,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781968523] [2022-07-22 12:01:27,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:27,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:27,872 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:27,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-22 12:01:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:27,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:27,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:27,904 INFO L85 PathProgramCache]: Analyzing trace with hash 383397, now seen corresponding path program 1 times [2022-07-22 12:01:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:27,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211348193] [2022-07-22 12:01:27,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:27,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:27,910 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:27,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:27,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:27,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1321644585, now seen corresponding path program 1 times [2022-07-22 12:01:27,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:27,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407263358] [2022-07-22 12:01:27,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:27,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:01:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:01:28,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:01:28,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407263358] [2022-07-22 12:01:28,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407263358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:01:28,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:01:28,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:01:28,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882587757] [2022-07-22 12:01:28,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:01:28,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:01:28,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:01:28,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:01:28,111 INFO L87 Difference]: Start difference. First operand 268 states and 621 transitions. cyclomatic complexity: 395 Second operand has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 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) [2022-07-22 12:01:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:01:28,132 INFO L93 Difference]: Finished difference Result 455 states and 1023 transitions. [2022-07-22 12:01:28,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 455 states and 1023 transitions. [2022-07-22 12:01:28,138 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 93 [2022-07-22 12:01:28,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 455 states to 321 states and 739 transitions. [2022-07-22 12:01:28,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2022-07-22 12:01:28,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2022-07-22 12:01:28,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 321 states and 739 transitions. [2022-07-22 12:01:28,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:01:28,142 INFO L220 hiAutomatonCegarLoop]: Abstraction has 321 states and 739 transitions. [2022-07-22 12:01:28,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 739 transitions. [2022-07-22 12:01:28,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2022-07-22 12:01:28,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 321 states have (on average 2.3021806853582554) internal successors, (739), 320 states have internal predecessors, (739), 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) [2022-07-22 12:01:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 739 transitions. [2022-07-22 12:01:28,154 INFO L242 hiAutomatonCegarLoop]: Abstraction has 321 states and 739 transitions. [2022-07-22 12:01:28,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:01:28,155 INFO L425 stractBuchiCegarLoop]: Abstraction has 321 states and 739 transitions. [2022-07-22 12:01:28,156 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:01:28,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 321 states and 739 transitions. [2022-07-22 12:01:28,158 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 93 [2022-07-22 12:01:28,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:01:28,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:01:28,160 INFO L150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:01:28,160 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:01:28,162 INFO L748 eck$LassoCheckResult]: Stem: 6420#[ULTIMATE.startENTRY]don't care [338] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6376#[L-1]don't care [261] L-1-->L-1-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] 6378#[L-1-1]don't care [340] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] 6424#[L-1-2]don't care [342] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 6172#[L21]don't care [313] L21-->L21-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_4| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] 6174#[L21-1]don't care [336] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_3| 1) 0) 48) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] 6388#[L21-2]don't care [268] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_4| 1) 1) 0) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 6390#[L21-3]don't care [302] L21-3-->L21-4: Formula: (and (= (select |v_#length_4| 2) 26) (= (select |v_#valid_5| 2) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 6076#[L21-4]don't care [282] L21-4-->L42: Formula: (and (= v_~queue~0.offset_3 0) (= v_~queue~0.base_3 0)) InVars {} OutVars{~queue~0.base=v_~queue~0.base_3, ~queue~0.offset=v_~queue~0.offset_3} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 6054#[L42]don't care [274] L42-->L42-1: Formula: (= v_~front~0_5 0) InVars {} OutVars{~front~0=v_~front~0_5} AuxVars[] AssignedVars[~front~0] 6056#[L42-1]don't care [337] L42-1-->L42-2: Formula: (= v_~back~0_6 0) InVars {} OutVars{~back~0=v_~back~0_6} AuxVars[] AssignedVars[~back~0] 6398#[L42-2]don't care [280] L42-2-->L42-3: Formula: (= v_~x~0_2 0) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0] 6336#[L42-3]don't care [252] L42-3-->L-1-3: Formula: (= v_~n~0_3 0) InVars {} OutVars{~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] 6338#[L-1-3]don't care [345] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6028#[L-1-4]don't care [266] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6030#[L-1-5]don't care [248] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 6320#[L-1-6]don't care [331] L-1-6-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_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_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] 6112#[L71]don't care [291] L71-->L71-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, 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_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 6114#[L71-1]don't care [251] L71-1-->L71-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 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_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, 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_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 6246#[L71-2]don't care [341] L71-2-->L74: Formula: (= 5 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 6248#[L74]don't care [290] L74-->L74-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_2| v_~n~0_4) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[~n~0] 6180#[L74-1]don't care [315] L74-1-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 6182#[L75]don't care [277] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~front~0_6) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ~front~0=v_~front~0_6} AuxVars[] AssignedVars[~front~0] 6352#[L75-1]don't care [255] L75-1-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 6090#[L76]don't care [285] L76-->L77: Formula: (= v_~back~0_7 v_~front~0_7) InVars {~front~0=v_~front~0_7} OutVars{~back~0=v_~back~0_7, ~front~0=v_~front~0_7} AuxVars[] AssignedVars[~back~0] 6092#[L77]don't care [294] L77-->L77-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6154#[L77-1]don't care [305] L77-1-->L77-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_5) InVars {~n~0=v_~n~0_5} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_5} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 6156#[L77-2]don't care [264] L77-2-->L77-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 6128#[L77-3]don't care [296] L77-3-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 6130#[L91]don't care [253] L91-->L92: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 6220#[L92]don't care [329] L92-->L92-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6190#[L92-1]don't care [319] L92-1-->L92-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, 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] 6192#[L92-2]don't care [278] L92-2-->L37: 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] 6060#[L37]don't care [275] L37-->L38: 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] 6062#[L38]don't care [284] L38-->L37-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[] 6396#[L37-1]don't care [276] L37-1-->L93: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6000#[L93]don't care [257] L93-->L93-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6002#[L93-1]don't care [332] L93-1-->L93-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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] 6176#[L93-2]don't care [314] L93-2-->L37-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] 6178#[L37-2]don't care [249] L37-2-->L38-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] 6004#[L38-3]don't care [259] L38-3-->L37-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[] 5990#[L37-3]don't care [256] L37-3-->L95: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5992#[L95]don't care [306] L95-->L95-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| |v_#StackHeapBarrier_4|) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2| 0) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| 1)) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length] 6184#[L95-1]don't care [317] L95-1-->L95-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 6186#[L95-2]don't care [318] L95-2-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset] 6188#[L96]don't care [330] L96-->L96-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 6288#[L96-6]don't care [241] L96-6-->L97: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 6290#[L97]don't care [292] L97-->L97-1: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0 4) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|)) |v_#memory_int_5|) (<= 0 .cse1) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int] 6402#[L97-1]don't care [301] L97-1-->L96-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet18#1] 6006#[L96-3]don't care [262] L96-3-->L96-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 6008#[L96-4]don't care [307] L96-4-->L96-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1] 6408#[L96-5]don't care [320] L96-5-->L96-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1] 6292#[L96-6]don't care [240] L96-6-->L96-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 6124#[L96-7]don't care [295] L96-7-->L99: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 6126#[L99]don't care [325] L99-->L77-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 6210#[L77-4]don't care [326] L77-4-->L77-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6212#[L77-5]don't care [246] L77-5-->L77-6: Formula: (and (= v_~queue~0.offset_4 |v_ULTIMATE.start_main_#t~ret9#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret9#1.base_3| v_~queue~0.base_4)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} OutVars{~queue~0.offset=v_~queue~0.offset_4, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|, ~queue~0.base=v_~queue~0.base_4, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|} AuxVars[] AssignedVars[~queue~0.offset, ~queue~0.base] 5900#[L77-6]don't care [242] L77-6-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 5902#[L80]don't care [238] L80-->L80-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 6286#[L80-1]don't care [334] L80-1-->L80-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 5944#[L80-2]don't care [250] L80-2-->L80-3: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_7|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, 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~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, 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] 5946#[L80-3]don't care [364] L80-3-->L52: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1, thread1Thread1of1ForFork0_#res#1.base] 6148#[L52, L80-4]don't care [273] L80-4-->L80-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 5938#[L52, L80-5]don't care [324] L80-5-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 5940#[L52, L81]don't care [339] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 5956#[L52, L81-1]don't care [235] L81-1-->L81-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 5958#[L52, L81-2]don't care [310] L81-2-->L81-3: Formula: (and (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_13| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre12#1_3|)) |v_#memory_int_9|)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 6298#[L52, L81-3]don't care [348] L52-->L47-2: Formula: (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_3| 256) 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[] 6070#[L47-2, L81-3]don't care [351] L47-2-->L48: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet1#1] 6072#[L81-3, L48]don't care [353] L48-->L52: Formula: (let ((.cse1 (* 4 v_~back~0_51))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_27))) (and (= (select |v_#valid_43| v_~queue~0.base_27) 1) (= (ite (= 5 (select (select |v_#memory_int_35| v_~queue~0.base_27) .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= (+ v_~back~0_51 1) v_~back~0_50) (<= (+ .cse1 4 v_~queue~0.offset_27) (select |v_#length_38| v_~queue~0.base_27)) (not (= (ite (and (<= 0 v_~back~0_51) (< v_~back~0_51 v_~n~0_24)) 1 0) 0)) (<= 0 .cse0)))) InVars {~queue~0.offset=v_~queue~0.offset_27, #valid=|v_#valid_43|, ~back~0=v_~back~0_51, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_24} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~queue~0.offset=v_~queue~0.offset_27, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_1|, #valid=|v_#valid_43|, ~back~0=v_~back~0_50, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, #length=|v_#length_38|, ~queue~0.base=v_~queue~0.base_27, ~n~0=v_~n~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] 6044#[L52, L81-3]don't care [367] L81-3-->L64: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_4|, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_10|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~nondet4#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 6296#[L64, L81-4, L52]don't care [2022-07-22 12:01:28,162 INFO L750 eck$LassoCheckResult]: Loop: 6296#[L64, L81-4, L52]don't care [356] L64-->L59-2: Formula: (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_3| 256) 0)) InVars {thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_3|} OutVars{thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_3|} AuxVars[] AssignedVars[] 6356#[L59-2, L81-4, L52]don't care [359] L59-2-->L60: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet4#1] 6380#[L60, L81-4, L52]don't care [361] L60-->L64: Formula: (let ((.cse1 (* v_~front~0_35 4))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_31))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (<= 0 .cse0) (= (ite (and (< v_~front~0_35 v_~n~0_26) (< v_~front~0_35 v_~back~0_54) (<= 0 v_~front~0_35)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= v_~x~0_19 (select (select |v_#memory_int_39| v_~queue~0.base_31) .cse0)) (= (select |v_#valid_47| v_~queue~0.base_31) 1) (<= (+ .cse1 4 v_~queue~0.offset_31) (select |v_#length_42| v_~queue~0.base_31)) (= v_~front~0_34 (+ v_~front~0_35 1))))) InVars {~queue~0.offset=v_~queue~0.offset_31, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_39|, ~back~0=v_~back~0_54, #length=|v_#length_42|, ~queue~0.base=v_~queue~0.base_31, ~n~0=v_~n~0_26, ~front~0=v_~front~0_35} OutVars{~queue~0.offset=v_~queue~0.offset_31, ~back~0=v_~back~0_54, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~queue~0.base=v_~queue~0.base_31, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_39|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, #length=|v_#length_42|, ~n~0=v_~n~0_26, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_1|, ~x~0=v_~x~0_19, ~front~0=v_~front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, ~x~0, ~front~0] 6296#[L64, L81-4, L52]don't care [2022-07-22 12:01:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1322215599, now seen corresponding path program 1 times [2022-07-22 12:01:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:28,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408405757] [2022-07-22 12:01:28,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:28,192 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:28,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:28,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:28,225 INFO L85 PathProgramCache]: Analyzing trace with hash 383397, now seen corresponding path program 2 times [2022-07-22 12:01:28,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:28,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478261988] [2022-07-22 12:01:28,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:28,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:28,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:28,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:28,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:01:28,237 INFO L85 PathProgramCache]: Analyzing trace with hash -979484587, now seen corresponding path program 1 times [2022-07-22 12:01:28,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:01:28,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493774600] [2022-07-22 12:01:28,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:01:28,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:01:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:28,268 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:01:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:01:28,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:01:30,482 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:01:30,482 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:01:30,482 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:01:30,482 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:01:30,482 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:01:30,482 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:01:30,483 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:01:30,483 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:01:30,483 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-simple-queue.wvr.c_BEv2_Iteration5_Lasso [2022-07-22 12:01:30,483 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:01:30,483 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:01:30,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:30,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:01:31,471 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:01:31,476 INFO L158 Benchmark]: Toolchain (without parser) took 14182.21ms. Allocated memory was 164.6MB in the beginning and 255.9MB in the end (delta: 91.2MB). Free memory was 139.8MB in the beginning and 184.4MB in the end (delta: -44.6MB). Peak memory consumption was 122.0MB. Max. memory is 8.0GB. [2022-07-22 12:01:31,477 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 164.6MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:01:31,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.57ms. Allocated memory is still 164.6MB. Free memory was 139.5MB in the beginning and 128.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:01:31,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.34ms. Allocated memory is still 164.6MB. Free memory was 128.8MB in the beginning and 126.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:01:31,479 INFO L158 Benchmark]: Boogie Preprocessor took 30.45ms. Allocated memory is still 164.6MB. Free memory was 126.9MB in the beginning and 125.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:01:31,480 INFO L158 Benchmark]: RCFGBuilder took 756.14ms. Allocated memory is still 164.6MB. Free memory was 125.5MB in the beginning and 139.5MB in the end (delta: -14.0MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2022-07-22 12:01:31,481 INFO L158 Benchmark]: BuchiAutomizer took 12891.03ms. Allocated memory was 164.6MB in the beginning and 255.9MB in the end (delta: 91.2MB). Free memory was 139.5MB in the beginning and 184.4MB in the end (delta: -44.9MB). Peak memory consumption was 121.3MB. Max. memory is 8.0GB. [2022-07-22 12:01:31,487 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 164.6MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 427.57ms. Allocated memory is still 164.6MB. Free memory was 139.5MB in the beginning and 128.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.34ms. Allocated memory is still 164.6MB. Free memory was 128.8MB in the beginning and 126.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.45ms. Allocated memory is still 164.6MB. Free memory was 126.9MB in the beginning and 125.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 756.14ms. Allocated memory is still 164.6MB. Free memory was 125.5MB in the beginning and 139.5MB in the end (delta: -14.0MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 12891.03ms. Allocated memory was 164.6MB in the beginning and 255.9MB in the end (delta: 91.2MB). Free memory was 139.5MB in the beginning and 184.4MB in the end (delta: -44.9MB). Peak memory consumption was 121.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:01:31,533 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...