/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-more-min-le-max.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 11:58:35,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:58:35,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:58:35,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:58:35,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:58:35,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:58:35,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:58:35,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:58:35,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:58:35,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:58:35,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:58:35,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:58:35,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:58:35,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:58:35,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:58:35,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:58:35,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:58:35,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:58:35,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:58:35,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:58:35,744 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:58:35,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:58:35,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:58:35,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:58:35,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:58:35,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:58:35,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:58:35,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:58:35,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:58:35,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:58:35,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:58:35,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:58:35,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:58:35,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:58:35,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:58:35,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:58:35,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:58:35,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:58:35,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:58:35,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:58:35,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:58:35,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:58:35,771 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 11:58:35,798 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:58:35,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:58:35,799 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:58:35,799 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:58:35,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:58:35,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:58:35,801 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:58:35,801 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 11:58:35,802 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 11:58:35,802 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 11:58:35,802 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 11:58:35,802 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 11:58:35,802 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 11:58:35,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:58:35,803 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:58:35,803 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 11:58:35,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:58:35,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:58:35,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:58:35,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 11:58:35,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 11:58:35,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 11:58:35,804 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:58:35,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:58:35,805 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 11:58:35,805 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:58:35,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 11:58:35,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:58:35,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:58:35,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:58:35,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:58:35,806 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:58:35,807 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 11:58:35,808 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 11:58:36,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:58:36,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:58:36,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:58:36,207 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:58:36,208 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:58:36,210 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-le-max.wvr.c [2022-07-22 11:58:36,305 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3185a60b/8c1c8a0409d247da9dff92c7e33a2383/FLAG9264a006e [2022-07-22 11:58:37,107 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:58:37,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-le-max.wvr.c [2022-07-22 11:58:37,120 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3185a60b/8c1c8a0409d247da9dff92c7e33a2383/FLAG9264a006e [2022-07-22 11:58:37,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3185a60b/8c1c8a0409d247da9dff92c7e33a2383 [2022-07-22 11:58:37,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:58:37,431 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 11:58:37,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:58:37,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:58:37,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:58:37,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:58:37" (1/1) ... [2022-07-22 11:58:37,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@482aad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:58:37, skipping insertion in model container [2022-07-22 11:58:37,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:58:37" (1/1) ... [2022-07-22 11:58:37,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:58:37,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:58:37,675 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-more-min-le-max.wvr.c[2486,2499] [2022-07-22 11:58:37,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:58:37,693 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:58:37,724 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-more-min-le-max.wvr.c[2486,2499] [2022-07-22 11:58:37,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:58:37,751 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:58:37,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:58:37 WrapperNode [2022-07-22 11:58:37,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:58:37,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:58:37,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:58:37,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:58:37,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:58:37" (1/1) ... [2022-07-22 11:58:37,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:58:37" (1/1) ... [2022-07-22 11:58:37,804 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-07-22 11:58:37,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:58:37,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:58:37,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:58:37,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:58:37,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:58:37" (1/1) ... [2022-07-22 11:58:37,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:58:37" (1/1) ... [2022-07-22 11:58:37,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:58:37" (1/1) ... [2022-07-22 11:58:37,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:58:37" (1/1) ... [2022-07-22 11:58:37,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:58:37" (1/1) ... [2022-07-22 11:58:37,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:58:37" (1/1) ... [2022-07-22 11:58:37,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:58:37" (1/1) ... [2022-07-22 11:58:37,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:58:37,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:58:37,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:58:37,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:58:37,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:58:37" (1/1) ... [2022-07-22 11:58:37,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:37,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:37,893 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 11:58:37,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 11:58:37,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:58:37,963 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 11:58:37,964 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 11:58:37,964 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 11:58:37,964 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 11:58:37,964 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 11:58:37,964 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 11:58:37,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:58:37,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 11:58:37,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 11:58:37,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 11:58:37,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 11:58:37,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:58:37,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:58:37,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:58:37,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 11:58:37,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 11:58:37,968 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 11:58:38,075 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:58:38,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:58:38,477 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:58:38,640 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:58:38,640 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 11:58:38,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:58:38 BoogieIcfgContainer [2022-07-22 11:58:38,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:58:38,650 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 11:58:38,650 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 11:58:38,654 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 11:58:38,655 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:58:38,656 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 11:58:37" (1/3) ... [2022-07-22 11:58:38,657 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43033b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:58:38, skipping insertion in model container [2022-07-22 11:58:38,657 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:58:38,657 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:58:37" (2/3) ... [2022-07-22 11:58:38,657 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43033b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:58:38, skipping insertion in model container [2022-07-22 11:58:38,657 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:58:38,658 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:58:38" (3/3) ... [2022-07-22 11:58:38,659 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-min-le-max.wvr.c [2022-07-22 11:58:38,756 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 11:58:38,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 146 places, 149 transitions, 322 flow [2022-07-22 11:58:38,862 INFO L129 PetriNetUnfolder]: 10/143 cut-off events. [2022-07-22 11:58:38,862 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 11:58:38,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 10/143 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-07-22 11:58:38,868 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 149 transitions, 322 flow [2022-07-22 11:58:38,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 143 transitions, 304 flow [2022-07-22 11:58:38,896 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 11:58:38,896 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 11:58:38,897 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 11:58:38,897 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 11:58:38,897 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 11:58:38,897 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 11:58:38,897 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 11:58:38,898 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 11:58:38,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 11:58:39,304 INFO L131 ngComponentsAnalysis]: Automaton has 217 accepting balls. 1526 [2022-07-22 11:58:39,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:58:39,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:58:39,316 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] [2022-07-22 11:58:39,316 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 11:58:39,317 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 11:58:39,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 2048 states, but on-demand construction may add more states [2022-07-22 11:58:39,371 INFO L131 ngComponentsAnalysis]: Automaton has 217 accepting balls. 1526 [2022-07-22 11:58:39,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:58:39,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:58:39,376 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] [2022-07-22 11:58:39,377 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 11:58:39,386 INFO L748 eck$LassoCheckResult]: Stem: 149#[ULTIMATE.startENTRY]don't care [350] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 152#[L-1]don't care [260] 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] 154#[L-1-1]don't care [359] L-1-1-->L-1-2: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 156#[L-1-2]don't care [362] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 158#[L21]don't care [317] L21-->L21-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_5| 1))) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 160#[L21-1]don't care [347] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 162#[L21-2]don't care [272] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[] 164#[L21-3]don't care [310] L21-3-->L21-4: Formula: (and (= (select |v_#valid_7| 2) 1) (= (select |v_#length_6| 2) 29)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 166#[L21-4]don't care [293] L21-4-->L41: Formula: (and (= v_~A~0.offset_5 0) (= v_~A~0.base_5 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_5, ~A~0.offset=v_~A~0.offset_5} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 168#[L41]don't care [249] L41-->L41-1: Formula: (= v_~min~0_5 0) InVars {} OutVars{~min~0=v_~min~0_5} AuxVars[] AssignedVars[~min~0] 170#[L41-1]don't care [261] L41-1-->L41-2: Formula: (= v_~max~0_5 0) InVars {} OutVars{~max~0=v_~max~0_5} AuxVars[] AssignedVars[~max~0] 172#[L41-2]don't care [273] L41-2-->L42: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 174#[L42]don't care [281] L42-->L-1-3: Formula: (= v_~v_assert~0_2 0) InVars {} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[~v_assert~0] 176#[L-1-3]don't care [364] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 178#[L-1-4]don't care [267] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 180#[L-1-5]don't care [235] 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] 182#[L-1-6]don't care [340] L-1-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 184#[L79]don't care [278] L79-->L79-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, 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_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 186#[L79-1]don't care [343] L79-1-->L79-2: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_9|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, 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_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 188#[L79-2]don't care [257] L79-2-->L79-3: Formula: (and (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4) |v_#length_11|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (= |v_#valid_12| (store |v_#valid_13| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_12|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 190#[L79-3]don't care [264] L79-3-->L82: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_2| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 192#[L82]don't care [313] L82-->L83: 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] 194#[L83]don't care [243] L83-->L83-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 196#[L83-1]don't care [296] L83-1-->L83-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} 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_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 198#[L83-2]don't care [342] L83-2-->L83-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] 200#[L83-3]don't care [346] L83-3-->L103: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_1|, 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_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_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_#t~malloc20#1.base, 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_#t~malloc20#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1] 202#[L103]don't care [348] L103-->L104: 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] 204#[L104]don't care [239] L104-->L104-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 206#[L104-1]don't care [365] L104-1-->L104-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] 208#[L104-2]don't care [366] L104-2-->L36: 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] 210#[L36]don't care [356] L36-->L37: 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] 212#[L37]don't care [283] L37-->L36-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[] 216#[L36-1]don't care [345] L36-1-->L105: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 218#[L105]don't care [238] L105-->L105-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 220#[L105-1]don't care [287] L105-1-->L105-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] 222#[L105-2]don't care [262] L105-2-->L36-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] 224#[L36-2]don't care [334] L36-2-->L37-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] 226#[L37-3]don't care [251] L37-3-->L36-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[] 230#[L36-3]don't care [303] L36-3-->L107: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 232#[L107]don't care [358] L107-->L107-1: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2| |v_#StackHeapBarrier_5|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_2| 0) (= (store |v_#length_14| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_13|) (= (store |v_#valid_15| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2| 1) |v_#valid_14|) (= (select |v_#valid_15| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_14|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #valid=|v_#valid_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_2|, #length=|v_#length_13|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset, #length] 234#[L107-1]don't care [351] L107-1-->L107-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_3|, 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~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#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] 236#[L107-2]don't care [295] L107-2-->L108: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset] 238#[L108]don't care [241] L108-->L108-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 240#[L108-6]don't care [2022-07-22 11:58:39,388 INFO L750 eck$LassoCheckResult]: Loop: 240#[L108-6]don't care [290] L108-6-->L109: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[] 244#[L109]don't care [337] L109-->L109-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_2|)) |v_#memory_int_7|) (= (select |v_#valid_16| |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|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_15|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_2|} 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|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_7|, #length=|v_#length_15|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_2|} AuxVars[] AssignedVars[#memory_int] 248#[L109-1]don't care [352] L109-1-->L108-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet22#1] 252#[L108-3]don't care [229] L108-3-->L108-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1] 256#[L108-4]don't care [328] L108-4-->L108-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 260#[L108-5]don't care [246] L108-5-->L108-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1] 240#[L108-6]don't care [2022-07-22 11:58:39,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:39,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1237781255, now seen corresponding path program 1 times [2022-07-22 11:58:39,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:58:39,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822834582] [2022-07-22 11:58:39,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:58:39,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:58:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:39,571 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:58:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:39,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:58:39,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:39,690 INFO L85 PathProgramCache]: Analyzing trace with hash 921966371, now seen corresponding path program 1 times [2022-07-22 11:58:39,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:58:39,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312372248] [2022-07-22 11:58:39,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:58:39,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:58:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:39,735 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:58:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:39,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:58:39,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:39,766 INFO L85 PathProgramCache]: Analyzing trace with hash -244562519, now seen corresponding path program 1 times [2022-07-22 11:58:39,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:58:39,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103336072] [2022-07-22 11:58:39,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:58:39,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:58:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:39,851 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:58:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:39,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:58:41,256 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:58:41,257 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:58:41,257 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:58:41,257 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:58:41,258 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:58:41,258 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:41,258 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:58:41,258 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:58:41,258 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-min-le-max.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 11:58:41,259 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:58:41,259 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:58:41,283 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 11:58:41,290 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 11:58:41,292 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 11:58:41,293 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 11:58:41,296 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 11:58:41,298 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 11:58:41,739 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 11:58:41,741 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 11:58:41,775 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 11:58:41,778 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 11:58:41,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 11:58:41,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 11:58:41,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 11:58:41,790 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 11:58:41,792 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 11:58:41,794 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 11:58:41,796 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 11:58:41,798 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 11:58:41,800 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 11:58:41,802 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 11:58:41,804 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 11:58:41,806 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 11:58:41,808 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 11:58:41,810 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 11:58:41,812 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 11:58:41,814 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 11:58:41,816 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 11:58:41,818 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 11:58:41,821 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 11:58:41,823 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 11:58:41,825 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 11:58:41,831 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 11:58:41,833 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 11:58:41,838 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 11:58:41,840 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 11:58:41,841 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 11:58:41,843 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 11:58:41,845 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 11:58:42,347 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:58:42,353 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 11:58:42,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:42,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:42,356 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 11:58:42,360 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 11:58:42,365 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 11:58:42,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:58:42,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:58:42,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:58:42,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:58:42,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:58:42,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:58:42,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:58:42,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 11:58:42,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:42,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:42,424 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 11:58:42,425 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 11:58:42,425 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 11:58:42,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:58:42,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:58:42,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:58:42,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:58:42,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:58:42,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:58:42,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:58:42,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:58:42,485 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 11:58:42,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:42,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:42,487 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 11:58:42,494 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 11:58:42,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:58:42,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:58:42,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:58:42,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:58:42,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:58:42,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:58:42,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:58:42,506 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 11:58:42,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:58:42,550 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 11:58:42,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:42,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:42,552 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 11:58:42,554 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 11:58:42,554 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 11:58:42,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:58:42,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:58:42,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:58:42,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:58:42,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:58:42,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:58:42,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:58:42,625 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 11:58:42,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:42,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:42,627 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 11:58:42,636 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 11:58:42,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:58:42,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:58:42,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:58:42,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:58:42,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:58:42,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:58:42,652 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 11:58:42,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:58:42,702 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 11:58:42,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:42,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:42,704 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 11:58:42,707 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 11:58:42,707 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 11:58:42,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:58:42,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:58:42,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:58:42,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:58:42,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:58:42,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:58:42,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:58:42,772 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 11:58:42,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:42,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:42,774 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 11:58:42,777 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 11:58:42,777 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 11:58:42,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:58:42,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:58:42,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:58:42,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:58:42,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:58:42,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:58:42,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:58:42,818 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 11:58:42,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:42,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:42,820 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 11:58:42,822 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 11:58:42,823 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 11:58:42,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:58:42,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:58:42,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:58:42,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:58:42,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:58:42,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:58:42,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:58:42,862 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 11:58:42,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:42,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:42,865 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 11:58:42,866 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 11:58:42,867 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 11:58:42,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:58:42,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:58:42,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:58:42,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:58:42,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:58:42,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:58:42,899 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 11:58:42,931 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-22 11:58:42,932 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-22 11:58:42,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:42,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:42,950 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 11:58:42,992 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 11:58:42,992 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 11:58:43,013 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 11:58:43,014 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 11:58:43,015 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset - 4*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 Supporting invariants [] [2022-07-22 11:58:43,084 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 11:58:43,213 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 11:58:43,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:58:43,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:58:43,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:58:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:58:43,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:58:43,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:58:43,425 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 11:58:43,472 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-07-22 11:58:43,476 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 2048 states, but on-demand construction may add more states Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 11:58:43,783 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 11:58:43,845 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 2048 states, but on-demand construction may add more states. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 6050 states and 20287 transitions. Complement of second has 9 states. [2022-07-22 11:58:43,848 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 11:58:43,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 11:58:43,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 245 transitions. [2022-07-22 11:58:43,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 245 transitions. Stem has 43 letters. Loop has 6 letters. [2022-07-22 11:58:43,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:58:43,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 245 transitions. Stem has 49 letters. Loop has 6 letters. [2022-07-22 11:58:43,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:58:43,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 245 transitions. Stem has 43 letters. Loop has 12 letters. [2022-07-22 11:58:43,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:58:43,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6050 states and 20287 transitions. [2022-07-22 11:58:43,977 INFO L131 ngComponentsAnalysis]: Automaton has 216 accepting balls. 1520 [2022-07-22 11:58:44,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6050 states to 1783 states and 5709 transitions. [2022-07-22 11:58:44,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1775 [2022-07-22 11:58:44,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1777 [2022-07-22 11:58:44,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1783 states and 5709 transitions. [2022-07-22 11:58:44,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 11:58:44,038 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1783 states and 5709 transitions. [2022-07-22 11:58:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states and 5709 transitions. [2022-07-22 11:58:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1782. [2022-07-22 11:58:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1782 states have (on average 3.2031425364758697) internal successors, (5708), 1781 states have internal predecessors, (5708), 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 11:58:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 5708 transitions. [2022-07-22 11:58:44,191 INFO L242 hiAutomatonCegarLoop]: Abstraction has 1782 states and 5708 transitions. [2022-07-22 11:58:44,191 INFO L425 stractBuchiCegarLoop]: Abstraction has 1782 states and 5708 transitions. [2022-07-22 11:58:44,191 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 11:58:44,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1782 states and 5708 transitions. [2022-07-22 11:58:44,214 INFO L131 ngComponentsAnalysis]: Automaton has 216 accepting balls. 1520 [2022-07-22 11:58:44,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:58:44,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:58:44,219 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] [2022-07-22 11:58:44,219 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:58:44,223 INFO L748 eck$LassoCheckResult]: Stem: 12634#[ULTIMATE.startENTRY]don't care [350] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12636#[L-1]don't care [260] 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] 12664#[L-1-1]don't care [359] L-1-1-->L-1-2: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 12666#[L-1-2]don't care [362] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 13798#[L21]don't care [317] L21-->L21-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_5| 1))) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 13400#[L21-1]don't care [347] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 11516#[L21-2]don't care [272] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[] 11518#[L21-3]don't care [310] L21-3-->L21-4: Formula: (and (= (select |v_#valid_7| 2) 1) (= (select |v_#length_6| 2) 29)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 13318#[L21-4]don't care [293] L21-4-->L41: Formula: (and (= v_~A~0.offset_5 0) (= v_~A~0.base_5 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_5, ~A~0.offset=v_~A~0.offset_5} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 14086#[L41]don't care [249] L41-->L41-1: Formula: (= v_~min~0_5 0) InVars {} OutVars{~min~0=v_~min~0_5} AuxVars[] AssignedVars[~min~0] 13192#[L41-1]don't care [261] L41-1-->L41-2: Formula: (= v_~max~0_5 0) InVars {} OutVars{~max~0=v_~max~0_5} AuxVars[] AssignedVars[~max~0] 13194#[L41-2]don't care [273] L41-2-->L42: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 14034#[L42]don't care [281] L42-->L-1-3: Formula: (= v_~v_assert~0_2 0) InVars {} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[~v_assert~0] 13428#[L-1-3]don't care [364] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 10796#[L-1-4]don't care [267] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 10798#[L-1-5]don't care [235] 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] 11724#[L-1-6]don't care [340] L-1-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 11726#[L79]don't care [278] L79-->L79-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, 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_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 14014#[L79-1]don't care [343] L79-1-->L79-2: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_9|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, 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_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 13944#[L79-2]don't care [257] L79-2-->L79-3: Formula: (and (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4) |v_#length_11|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (= |v_#valid_12| (store |v_#valid_13| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_12|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 13858#[L79-3]don't care [264] L79-3-->L82: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_2| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 13860#[L82]don't care [313] L82-->L83: 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] 12756#[L83]don't care [243] L83-->L83-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12758#[L83-1]don't care [296] L83-1-->L83-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} 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_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 13910#[L83-2]don't care [342] L83-2-->L83-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] 13056#[L83-3]don't care [346] L83-3-->L103: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_1|, 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_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_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_#t~malloc20#1.base, 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_#t~malloc20#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1] 13058#[L103]don't care [348] L103-->L104: 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] 14110#[L104]don't care [239] L104-->L104-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11832#[L104-1]don't care [365] L104-1-->L104-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] 11834#[L104-2]don't care [366] L104-2-->L36: 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] 12680#[L36]don't care [356] L36-->L37: 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] 10850#[L37]don't care [283] L37-->L36-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[] 10852#[L36-1]don't care [345] L36-1-->L105: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13382#[L105]don't care [238] L105-->L105-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 14116#[L105-1]don't care [287] L105-1-->L105-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] 12796#[L105-2]don't care [262] L105-2-->L36-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] 12798#[L36-2]don't care [334] L36-2-->L37-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] 14004#[L37-3]don't care [251] L37-3-->L36-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[] 14026#[L36-3]don't care [303] L36-3-->L107: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 14098#[L107]don't care [358] L107-->L107-1: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2| |v_#StackHeapBarrier_5|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_2| 0) (= (store |v_#length_14| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_13|) (= (store |v_#valid_15| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2| 1) |v_#valid_14|) (= (select |v_#valid_15| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_14|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #valid=|v_#valid_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_2|, #length=|v_#length_13|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset, #length] 13642#[L107-1]don't care [351] L107-1-->L107-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_3|, 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~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#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] 13266#[L107-2]don't care [295] L107-2-->L108: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset] 13268#[L108]don't care [241] L108-->L108-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 13838#[L108-6]don't care [289] L108-6-->L108-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[] 14104#[L108-7]don't care [360] L108-7-->L111: 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] 13150#[L111]don't care [240] L111-->L83-4: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret8#1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) 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~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#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~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 13152#[L83-4]don't care [294] L83-4-->L83-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12782#[L83-5]don't care [253] L83-5-->L83-6: Formula: (and (= v_~A~0.offset_6 |v_ULTIMATE.start_main_#t~ret8#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret8#1.base_3| v_~A~0.base_6)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} OutVars{~A~0.base=v_~A~0.base_6, ~A~0.offset=v_~A~0.offset_6, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 12784#[L83-6]don't care [353] L83-6-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_4|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 13418#[L85]don't care [259] L85-->L85-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 14078#[L85-1]don't care [277] L85-1-->L85-2: Formula: (= (ite (< 0 v_~N~0_8) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) InVars {~N~0=v_~N~0_8} OutVars{~N~0=v_~N~0_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 13926#[L85-2]don't care [227] L85-2-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 13928#[L36-4]don't care [248] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 13942#[L37-6]don't care [299] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 14080#[L36-5]don't care [269] L36-5-->L86: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 14082#[L86]don't care [225] L86-->L86-1: Formula: (and (<= (+ v_~A~0.offset_7 4) (select |v_#length_16| v_~A~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_9| v_~A~0.base_7) v_~A~0.offset_7)) (= (select |v_#valid_17| v_~A~0.base_7) 1) (<= 0 v_~A~0.offset_7)) InVars {#memory_int=|v_#memory_int_9|, ~A~0.base=v_~A~0.base_7, #length=|v_#length_16|, ~A~0.offset=v_~A~0.offset_7, #valid=|v_#valid_17|} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] 13570#[L86-1]don't care [306] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_3| v_~min~0_6) InVars {ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|, ~min~0=v_~min~0_6} AuxVars[] AssignedVars[~min~0] 13572#[L86-2]don't care [367] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] 12050#[L87]don't care [279] L87-->L87-1: Formula: (and (<= (+ v_~A~0.offset_8 4) (select |v_#length_17| v_~A~0.base_8)) (= (select |v_#valid_18| v_~A~0.base_8) 1) (<= 0 v_~A~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem10#1_2| (select (select |v_#memory_int_10| v_~A~0.base_8) v_~A~0.offset_8))) InVars {#memory_int=|v_#memory_int_10|, ~A~0.base=v_~A~0.base_8, #length=|v_#length_17|, ~A~0.offset=v_~A~0.offset_8, #valid=|v_#valid_18|} OutVars{~A~0.base=v_~A~0.base_8, ~A~0.offset=v_~A~0.offset_8, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10#1] 12052#[L87-1]don't care [230] L87-1-->L87-2: Formula: (= v_~max~0_6 |v_ULTIMATE.start_main_#t~mem10#1_3|) InVars {ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_3|} OutVars{~max~0=v_~max~0_6, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_3|} AuxVars[] AssignedVars[~max~0] 10568#[L87-2]don't care [228] L87-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10#1] 10570#[L90]don't care [354] L90-->L90-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 12378#[L90-1]don't care [244] L90-1-->L90-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 11426#[L90-2]don't care [252] L90-2-->L90-3: Formula: (and (= (select |v_#valid_19| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_18| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre11#1_3|)))) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, 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~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, 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] 11428#[L90-3]don't care [393] L90-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 12684#[thread1ENTRY, L90-4]don't care [368] thread1ENTRY-->L47-4: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 12686#[L47-4, L90-4]don't care [2022-07-22 11:58:44,224 INFO L750 eck$LassoCheckResult]: Loop: 12686#[L47-4, L90-4]don't care [371] L47-4-->L48: Formula: (< v_thread1Thread1of1ForFork0_~i~0_5 v_~N~0_2) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 13732#[L48, L90-4]don't care [373] L48-->L49-4: Formula: (let ((.cse6 (* v_thread1Thread1of1ForFork0_~i~0_7 4))) (let ((.cse5 (+ .cse6 v_~A~0.offset_23))) (let ((.cse1 (<= 0 .cse5)) (.cse3 (<= (+ .cse6 v_~A~0.offset_23 4) (select |v_#length_38| v_~A~0.base_23))) (.cse4 (= (select |v_#valid_45| v_~A~0.base_23) 1))) (and (let ((.cse0 (select (select |v_#memory_int_34| v_~A~0.base_23) .cse5))) (let ((.cse2 (< .cse0 v_~min~0_20))) (or (and (= v_~min~0_19 .cse0) .cse1 .cse2 .cse3 .cse4) (and (= |v_thread1Thread1of1ForFork0_#t~mem3_2| |v_thread1Thread1of1ForFork0_#t~mem3_1|) (not .cse2) (= v_~min~0_20 v_~min~0_19))))) .cse1 .cse3 .cse4)))) InVars {~A~0.base=v_~A~0.base_23, ~A~0.offset=v_~A~0.offset_23, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_1|, ~min~0=v_~min~0_20, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_34|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_7, #length=|v_#length_38|} OutVars{~A~0.base=v_~A~0.base_23, ~A~0.offset=v_~A~0.offset_23, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_1|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_2|, ~min~0=v_~min~0_19, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_34|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_7, #length=|v_#length_38|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, ~min~0] 13146#[L49-4, L90-4]don't care [375] L49-4-->L47-2: Formula: (= v_thread1Thread1of1ForFork0_~i~0_9 |v_thread1Thread1of1ForFork0_#t~post1_1|) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 13148#[L47-2, L90-4]don't care [376] L47-2-->L47-3: Formula: (= v_thread1Thread1of1ForFork0_~i~0_11 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_11, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 13756#[L47-3, L90-4]don't care [377] L47-3-->L47-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 12686#[L47-4, L90-4]don't care [2022-07-22 11:58:44,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1079450153, now seen corresponding path program 1 times [2022-07-22 11:58:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:58:44,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440736479] [2022-07-22 11:58:44,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:58:44,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:58:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:58:44,458 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 11:58:44,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:58:44,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440736479] [2022-07-22 11:58:44,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440736479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:58:44,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:58:44,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 11:58:44,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586559166] [2022-07-22 11:58:44,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:58:44,464 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 11:58:44,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:44,465 INFO L85 PathProgramCache]: Analyzing trace with hash 382739893, now seen corresponding path program 1 times [2022-07-22 11:58:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:58:44,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283242157] [2022-07-22 11:58:44,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:58:44,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:58:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:44,473 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:58:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:44,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:58:44,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:58:44,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 11:58:44,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-22 11:58:44,615 INFO L87 Difference]: Start difference. First operand 1782 states and 5708 transitions. cyclomatic complexity: 4143 Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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 11:58:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:58:44,905 INFO L93 Difference]: Finished difference Result 1798 states and 5723 transitions. [2022-07-22 11:58:44,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1798 states and 5723 transitions. [2022-07-22 11:58:44,934 INFO L131 ngComponentsAnalysis]: Automaton has 216 accepting balls. 1520 [2022-07-22 11:58:44,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1798 states to 1786 states and 5711 transitions. [2022-07-22 11:58:44,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1776 [2022-07-22 11:58:44,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1776 [2022-07-22 11:58:44,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1786 states and 5711 transitions. [2022-07-22 11:58:44,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 11:58:44,967 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1786 states and 5711 transitions. [2022-07-22 11:58:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states and 5711 transitions. [2022-07-22 11:58:45,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1782. [2022-07-22 11:58:45,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1782 states have (on average 3.202581369248036) internal successors, (5707), 1781 states have internal predecessors, (5707), 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 11:58:45,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 5707 transitions. [2022-07-22 11:58:45,037 INFO L242 hiAutomatonCegarLoop]: Abstraction has 1782 states and 5707 transitions. [2022-07-22 11:58:45,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 11:58:45,039 INFO L425 stractBuchiCegarLoop]: Abstraction has 1782 states and 5707 transitions. [2022-07-22 11:58:45,039 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 11:58:45,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1782 states and 5707 transitions. [2022-07-22 11:58:45,058 INFO L131 ngComponentsAnalysis]: Automaton has 216 accepting balls. 1520 [2022-07-22 11:58:45,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:58:45,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:58:45,059 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, 1] [2022-07-22 11:58:45,060 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:58:45,061 INFO L748 eck$LassoCheckResult]: Stem: 18020#[ULTIMATE.startENTRY]don't care [350] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18022#[L-1]don't care [260] 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] 18050#[L-1-1]don't care [359] L-1-1-->L-1-2: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 18052#[L-1-2]don't care [362] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 19184#[L21]don't care [317] L21-->L21-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_5| 1))) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 18790#[L21-1]don't care [347] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 16902#[L21-2]don't care [272] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[] 16904#[L21-3]don't care [310] L21-3-->L21-4: Formula: (and (= (select |v_#valid_7| 2) 1) (= (select |v_#length_6| 2) 29)) InVars {#length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 18704#[L21-4]don't care [293] L21-4-->L41: Formula: (and (= v_~A~0.offset_5 0) (= v_~A~0.base_5 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_5, ~A~0.offset=v_~A~0.offset_5} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 19472#[L41]don't care [249] L41-->L41-1: Formula: (= v_~min~0_5 0) InVars {} OutVars{~min~0=v_~min~0_5} AuxVars[] AssignedVars[~min~0] 18578#[L41-1]don't care [261] L41-1-->L41-2: Formula: (= v_~max~0_5 0) InVars {} OutVars{~max~0=v_~max~0_5} AuxVars[] AssignedVars[~max~0] 18580#[L41-2]don't care [273] L41-2-->L42: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 19420#[L42]don't care [281] L42-->L-1-3: Formula: (= v_~v_assert~0_2 0) InVars {} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[~v_assert~0] 18814#[L-1-3]don't care [364] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 16172#[L-1-4]don't care [267] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 16174#[L-1-5]don't care [235] 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] 17112#[L-1-6]don't care [340] L-1-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 17114#[L79]don't care [278] L79-->L79-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, 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_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 19396#[L79-1]don't care [343] L79-1-->L79-2: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_9|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, 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_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 19330#[L79-2]don't care [257] L79-2-->L79-3: Formula: (and (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4) |v_#length_11|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (= |v_#valid_12| (store |v_#valid_13| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_12|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 19244#[L79-3]don't care [264] L79-3-->L82: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_2| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 19246#[L82]don't care [313] L82-->L83: 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] 18142#[L83]don't care [243] L83-->L83-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18144#[L83-1]don't care [296] L83-1-->L83-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} 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_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 19298#[L83-2]don't care [342] L83-2-->L83-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] 18442#[L83-3]don't care [346] L83-3-->L103: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_1|, 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_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_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_#t~malloc20#1.base, 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_#t~malloc20#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1] 18444#[L103]don't care [348] L103-->L104: 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] 19494#[L104]don't care [239] L104-->L104-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 17218#[L104-1]don't care [365] L104-1-->L104-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] 17220#[L104-2]don't care [366] L104-2-->L36: 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] 18066#[L36]don't care [356] L36-->L37: 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] 16236#[L37]don't care [283] L37-->L36-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[] 16238#[L36-1]don't care [345] L36-1-->L105: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18768#[L105]don't care [238] L105-->L105-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 19502#[L105-1]don't care [287] L105-1-->L105-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] 18182#[L105-2]don't care [262] L105-2-->L36-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] 18184#[L36-2]don't care [334] L36-2-->L37-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] 19390#[L37-3]don't care [251] L37-3-->L36-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[] 19412#[L36-3]don't care [303] L36-3-->L107: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 19484#[L107]don't care [358] L107-->L107-1: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2| |v_#StackHeapBarrier_5|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_2| 0) (= (store |v_#length_14| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_13|) (= (store |v_#valid_15| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2| 1) |v_#valid_14|) (= (select |v_#valid_15| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_14|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #valid=|v_#valid_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_2|, #length=|v_#length_13|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset, #length] 19028#[L107-1]don't care [351] L107-1-->L107-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_3|, 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~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#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] 18652#[L107-2]don't care [295] L107-2-->L108: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset] 18654#[L108]don't care [241] L108-->L108-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 19224#[L108-6]don't care [290] L108-6-->L109: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[] 19436#[L109]don't care [337] L109-->L109-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_2|)) |v_#memory_int_7|) (= (select |v_#valid_16| |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|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_15|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_2|} 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|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_7|, #length=|v_#length_15|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_2|} AuxVars[] AssignedVars[#memory_int] 19438#[L109-1]don't care [352] L109-1-->L108-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet22#1] 19210#[L108-3]don't care [229] L108-3-->L108-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1] 19212#[L108-4]don't care [328] L108-4-->L108-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 16796#[L108-5]don't care [246] L108-5-->L108-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1] 16800#[L108-6]don't care [289] L108-6-->L108-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[] 19500#[L108-7]don't care [360] L108-7-->L111: 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] 18536#[L111]don't care [240] L111-->L83-4: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret8#1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) 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~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#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~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 18538#[L83-4]don't care [294] L83-4-->L83-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18168#[L83-5]don't care [253] L83-5-->L83-6: Formula: (and (= v_~A~0.offset_6 |v_ULTIMATE.start_main_#t~ret8#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret8#1.base_3| v_~A~0.base_6)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} OutVars{~A~0.base=v_~A~0.base_6, ~A~0.offset=v_~A~0.offset_6, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 18170#[L83-6]don't care [353] L83-6-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_4|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 18798#[L85]don't care [259] L85-->L85-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 19464#[L85-1]don't care [277] L85-1-->L85-2: Formula: (= (ite (< 0 v_~N~0_8) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|) InVars {~N~0=v_~N~0_8} OutVars{~N~0=v_~N~0_8, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 19312#[L85-2]don't care [227] L85-2-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 19314#[L36-4]don't care [248] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 19328#[L37-6]don't care [299] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 19466#[L36-5]don't care [269] L36-5-->L86: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 19468#[L86]don't care [225] L86-->L86-1: Formula: (and (<= (+ v_~A~0.offset_7 4) (select |v_#length_16| v_~A~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9#1_2| (select (select |v_#memory_int_9| v_~A~0.base_7) v_~A~0.offset_7)) (= (select |v_#valid_17| v_~A~0.base_7) 1) (<= 0 v_~A~0.offset_7)) InVars {#memory_int=|v_#memory_int_9|, ~A~0.base=v_~A~0.base_7, #length=|v_#length_16|, ~A~0.offset=v_~A~0.offset_7, #valid=|v_#valid_17|} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] 18956#[L86-1]don't care [306] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~mem9#1_3| v_~min~0_6) InVars {ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|, ~min~0=v_~min~0_6} AuxVars[] AssignedVars[~min~0] 18958#[L86-2]don't care [367] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9#1] 17428#[L87]don't care [279] L87-->L87-1: Formula: (and (<= (+ v_~A~0.offset_8 4) (select |v_#length_17| v_~A~0.base_8)) (= (select |v_#valid_18| v_~A~0.base_8) 1) (<= 0 v_~A~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem10#1_2| (select (select |v_#memory_int_10| v_~A~0.base_8) v_~A~0.offset_8))) InVars {#memory_int=|v_#memory_int_10|, ~A~0.base=v_~A~0.base_8, #length=|v_#length_17|, ~A~0.offset=v_~A~0.offset_8, #valid=|v_#valid_18|} OutVars{~A~0.base=v_~A~0.base_8, ~A~0.offset=v_~A~0.offset_8, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10#1] 17430#[L87-1]don't care [230] L87-1-->L87-2: Formula: (= v_~max~0_6 |v_ULTIMATE.start_main_#t~mem10#1_3|) InVars {ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_3|} OutVars{~max~0=v_~max~0_6, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_3|} AuxVars[] AssignedVars[~max~0] 15954#[L87-2]don't care [228] L87-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10#1] 15956#[L90]don't care [354] L90-->L90-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 17764#[L90-1]don't care [244] L90-1-->L90-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 16812#[L90-2]don't care [252] L90-2-->L90-3: Formula: (and (= (select |v_#valid_19| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_18| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre11#1_3|)))) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, 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~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, 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] 16814#[L90-3]don't care [393] L90-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 18070#[thread1ENTRY, L90-4]don't care [368] thread1ENTRY-->L47-4: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 18072#[L47-4, L90-4]don't care [2022-07-22 11:58:45,062 INFO L750 eck$LassoCheckResult]: Loop: 18072#[L47-4, L90-4]don't care [371] L47-4-->L48: Formula: (< v_thread1Thread1of1ForFork0_~i~0_5 v_~N~0_2) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 19118#[L48, L90-4]don't care [373] L48-->L49-4: Formula: (let ((.cse6 (* v_thread1Thread1of1ForFork0_~i~0_7 4))) (let ((.cse5 (+ .cse6 v_~A~0.offset_23))) (let ((.cse1 (<= 0 .cse5)) (.cse3 (<= (+ .cse6 v_~A~0.offset_23 4) (select |v_#length_38| v_~A~0.base_23))) (.cse4 (= (select |v_#valid_45| v_~A~0.base_23) 1))) (and (let ((.cse0 (select (select |v_#memory_int_34| v_~A~0.base_23) .cse5))) (let ((.cse2 (< .cse0 v_~min~0_20))) (or (and (= v_~min~0_19 .cse0) .cse1 .cse2 .cse3 .cse4) (and (= |v_thread1Thread1of1ForFork0_#t~mem3_2| |v_thread1Thread1of1ForFork0_#t~mem3_1|) (not .cse2) (= v_~min~0_20 v_~min~0_19))))) .cse1 .cse3 .cse4)))) InVars {~A~0.base=v_~A~0.base_23, ~A~0.offset=v_~A~0.offset_23, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_1|, ~min~0=v_~min~0_20, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_34|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_7, #length=|v_#length_38|} OutVars{~A~0.base=v_~A~0.base_23, ~A~0.offset=v_~A~0.offset_23, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_1|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_2|, ~min~0=v_~min~0_19, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_34|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_7, #length=|v_#length_38|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, ~min~0] 18532#[L49-4, L90-4]don't care [375] L49-4-->L47-2: Formula: (= v_thread1Thread1of1ForFork0_~i~0_9 |v_thread1Thread1of1ForFork0_#t~post1_1|) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 18534#[L47-2, L90-4]don't care [376] L47-2-->L47-3: Formula: (= v_thread1Thread1of1ForFork0_~i~0_11 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_11, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 19142#[L47-3, L90-4]don't care [377] L47-3-->L47-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 18072#[L47-4, L90-4]don't care [2022-07-22 11:58:45,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:45,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1569912505, now seen corresponding path program 1 times [2022-07-22 11:58:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:58:45,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543093729] [2022-07-22 11:58:45,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:58:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:58:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:45,120 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:58:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:45,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:58:45,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:45,190 INFO L85 PathProgramCache]: Analyzing trace with hash 382739893, now seen corresponding path program 2 times [2022-07-22 11:58:45,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:58:45,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034324279] [2022-07-22 11:58:45,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:58:45,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:58:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:45,207 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:58:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:45,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:58:45,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1013712849, now seen corresponding path program 1 times [2022-07-22 11:58:45,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:58:45,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693706503] [2022-07-22 11:58:45,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:58:45,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:58:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:45,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:58:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:45,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:58:47,785 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:58:47,785 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:58:47,786 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:58:47,787 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:58:47,787 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:58:47,787 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:47,787 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:58:47,787 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:58:47,787 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-min-le-max.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 11:58:47,788 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:58:47,788 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:58:47,805 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 11:58:47,807 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 11:58:47,808 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 11:58:47,810 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 11:58:47,812 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 11:58:47,814 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 11:58:47,815 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 11:58:47,817 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 11:58:47,819 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 11:58:47,820 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 11:58:48,148 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:109) 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 11:58:48,156 INFO L158 Benchmark]: Toolchain (without parser) took 10726.36ms. Allocated memory was 154.1MB in the beginning and 230.7MB in the end (delta: 76.5MB). Free memory was 128.3MB in the beginning and 84.7MB in the end (delta: 43.6MB). Peak memory consumption was 120.5MB. Max. memory is 8.0GB. [2022-07-22 11:58:48,157 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 154.1MB. Free memory was 124.8MB in the beginning and 124.7MB in the end (delta: 127.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 11:58:48,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.95ms. Allocated memory is still 154.1MB. Free memory was 128.2MB in the beginning and 117.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 11:58:48,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.85ms. Allocated memory is still 154.1MB. Free memory was 117.2MB in the beginning and 115.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 11:58:48,164 INFO L158 Benchmark]: Boogie Preprocessor took 36.90ms. Allocated memory is still 154.1MB. Free memory was 115.4MB in the beginning and 113.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 11:58:48,167 INFO L158 Benchmark]: RCFGBuilder took 804.64ms. Allocated memory is still 154.1MB. Free memory was 113.9MB in the beginning and 132.5MB in the end (delta: -18.5MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. [2022-07-22 11:58:48,167 INFO L158 Benchmark]: BuchiAutomizer took 9502.69ms. Allocated memory was 154.1MB in the beginning and 230.7MB in the end (delta: 76.5MB). Free memory was 132.5MB in the beginning and 84.7MB in the end (delta: 47.8MB). Peak memory consumption was 123.8MB. Max. memory is 8.0GB. [2022-07-22 11:58:48,174 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.26ms. Allocated memory is still 154.1MB. Free memory was 124.8MB in the beginning and 124.7MB in the end (delta: 127.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 318.95ms. Allocated memory is still 154.1MB. Free memory was 128.2MB in the beginning and 117.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.85ms. Allocated memory is still 154.1MB. Free memory was 117.2MB in the beginning and 115.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.90ms. Allocated memory is still 154.1MB. Free memory was 115.4MB in the beginning and 113.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 804.64ms. Allocated memory is still 154.1MB. Free memory was 113.9MB in the beginning and 132.5MB in the end (delta: -18.5MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 9502.69ms. Allocated memory was 154.1MB in the beginning and 230.7MB in the end (delta: 76.5MB). Free memory was 132.5MB in the beginning and 84.7MB in the end (delta: 47.8MB). Peak memory consumption was 123.8MB. 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 11:58:48,233 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...