/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-0d686a6 [2022-07-26 13:36:25,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 13:36:25,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 13:36:25,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 13:36:25,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 13:36:25,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 13:36:25,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 13:36:25,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 13:36:25,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 13:36:25,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 13:36:25,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 13:36:25,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 13:36:25,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 13:36:25,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 13:36:25,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 13:36:25,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 13:36:25,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 13:36:25,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 13:36:25,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 13:36:25,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 13:36:25,639 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 13:36:25,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 13:36:25,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 13:36:25,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 13:36:25,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 13:36:25,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 13:36:25,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 13:36:25,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 13:36:25,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 13:36:25,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 13:36:25,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 13:36:25,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 13:36:25,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 13:36:25,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 13:36:25,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 13:36:25,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 13:36:25,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 13:36:25,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 13:36:25,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 13:36:25,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 13:36:25,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 13:36:25,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 13:36:25,658 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2022-07-26 13:36:25,693 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 13:36:25,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 13:36:25,694 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 13:36:25,694 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 13:36:25,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 13:36:25,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 13:36:25,695 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 13:36:25,695 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 13:36:25,695 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 13:36:25,696 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 13:36:25,696 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 13:36:25,696 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 13:36:25,696 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 13:36:25,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 13:36:25,697 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 13:36:25,697 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 13:36:25,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 13:36:25,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 13:36:25,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 13:36:25,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 13:36:25,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 13:36:25,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 13:36:25,697 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 13:36:25,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 13:36:25,698 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 13:36:25,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 13:36:25,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 13:36:25,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 13:36:25,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 13:36:25,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 13:36:25,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 13:36:25,699 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-26 13:36:25,700 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 13:36:25,700 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-26 13:36:25,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 13:36:25,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 13:36:25,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 13:36:25,930 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 13:36:25,947 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 13:36:25,949 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-26 13:36:26,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eeea8ddd/07c1684aadf843bfa5f3bde804bbbe22/FLAG183a6ec71 [2022-07-26 13:36:26,356 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 13:36:26,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-le-max.wvr.c [2022-07-26 13:36:26,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eeea8ddd/07c1684aadf843bfa5f3bde804bbbe22/FLAG183a6ec71 [2022-07-26 13:36:26,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eeea8ddd/07c1684aadf843bfa5f3bde804bbbe22 [2022-07-26 13:36:26,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 13:36:26,385 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 13:36:26,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 13:36:26,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 13:36:26,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 13:36:26,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:36:26" (1/1) ... [2022-07-26 13:36:26,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5833c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:26, skipping insertion in model container [2022-07-26 13:36:26,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:36:26" (1/1) ... [2022-07-26 13:36:26,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 13:36:26,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 13:36:26,656 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-26 13:36:26,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:36:26,670 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 13:36:26,714 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-26 13:36:26,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:36:26,729 INFO L208 MainTranslator]: Completed translation [2022-07-26 13:36:26,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:26 WrapperNode [2022-07-26 13:36:26,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 13:36:26,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 13:36:26,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 13:36:26,731 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 13:36:26,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:26" (1/1) ... [2022-07-26 13:36:26,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:26" (1/1) ... [2022-07-26 13:36:26,770 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-07-26 13:36:26,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 13:36:26,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 13:36:26,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 13:36:26,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 13:36:26,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:26" (1/1) ... [2022-07-26 13:36:26,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:26" (1/1) ... [2022-07-26 13:36:26,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:26" (1/1) ... [2022-07-26 13:36:26,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:26" (1/1) ... [2022-07-26 13:36:26,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:26" (1/1) ... [2022-07-26 13:36:26,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:26" (1/1) ... [2022-07-26 13:36:26,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:26" (1/1) ... [2022-07-26 13:36:26,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 13:36:26,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 13:36:26,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 13:36:26,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 13:36:26,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:26" (1/1) ... [2022-07-26 13:36:26,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:26,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:26,831 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-26 13:36:26,852 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-26 13:36:26,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 13:36:26,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 13:36:26,875 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 13:36:26,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 13:36:26,875 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 13:36:26,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-26 13:36:26,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-26 13:36:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 13:36:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 13:36:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 13:36:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 13:36:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 13:36:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-26 13:36:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 13:36:26,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 13:36:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 13:36:26,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 13:36:26,877 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 13:36:26,955 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 13:36:26,956 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 13:36:27,115 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 13:36:27,165 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 13:36:27,165 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-26 13:36:27,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:36:27 BoogieIcfgContainer [2022-07-26 13:36:27,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 13:36:27,167 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 13:36:27,167 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 13:36:27,170 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 13:36:27,170 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:36:27,171 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 01:36:26" (1/3) ... [2022-07-26 13:36:27,171 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a20eacd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:36:27, skipping insertion in model container [2022-07-26 13:36:27,171 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:36:27,171 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:26" (2/3) ... [2022-07-26 13:36:27,171 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a20eacd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:36:27, skipping insertion in model container [2022-07-26 13:36:27,171 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:36:27,172 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:36:27" (3/3) ... [2022-07-26 13:36:27,172 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-min-le-max.wvr.c [2022-07-26 13:36:27,230 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-26 13:36:27,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 146 places, 149 transitions, 322 flow [2022-07-26 13:36:27,283 INFO L129 PetriNetUnfolder]: 10/143 cut-off events. [2022-07-26 13:36:27,283 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-26 13:36:27,286 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-26 13:36:27,286 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 149 transitions, 322 flow [2022-07-26 13:36:27,291 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 143 transitions, 304 flow [2022-07-26 13:36:27,299 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 13:36:27,299 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 13:36:27,299 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 13:36:27,299 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 13:36:27,299 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 13:36:27,300 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 13:36:27,300 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 13:36:27,300 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 13:36:27,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 13:36:27,517 INFO L131 ngComponentsAnalysis]: Automaton has 217 accepting balls. 1526 [2022-07-26 13:36:27,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:36:27,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:36:27,521 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-26 13:36:27,521 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-26 13:36:27,522 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 13:36:27,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 2048 states, but on-demand construction may add more states [2022-07-26 13:36:27,567 INFO L131 ngComponentsAnalysis]: Automaton has 217 accepting balls. 1526 [2022-07-26 13:36:27,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:36:27,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:36:27,569 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-26 13:36:27,569 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-26 13:36:27,575 INFO L733 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-26 13:36:27,575 INFO L735 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-26 13:36:27,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:27,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1237781255, now seen corresponding path program 1 times [2022-07-26 13:36:27,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:27,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337913076] [2022-07-26 13:36:27,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:27,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:27,724 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:27,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:27,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:27,797 INFO L85 PathProgramCache]: Analyzing trace with hash 921966371, now seen corresponding path program 1 times [2022-07-26 13:36:27,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:27,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192031715] [2022-07-26 13:36:27,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:27,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:27,818 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:27,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:27,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:27,838 INFO L85 PathProgramCache]: Analyzing trace with hash -244562519, now seen corresponding path program 1 times [2022-07-26 13:36:27,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:27,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764668274] [2022-07-26 13:36:27,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:27,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:27,876 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:27,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:28,778 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:36:28,778 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:36:28,778 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:36:28,778 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:36:28,779 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:36:28,779 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:28,779 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:36:28,779 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:36:28,779 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-min-le-max.wvr.c_BEv2_Iteration1_Lasso [2022-07-26 13:36:28,779 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:36:28,779 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:36:28,794 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:28,801 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:28,802 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:28,804 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:28,806 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:28,808 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,113 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,114 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,116 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,118 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,120 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,121 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,124 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,126 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,127 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,129 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,131 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,135 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,137 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,139 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,144 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,145 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,148 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,152 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,154 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,156 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,158 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,160 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,162 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,164 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,166 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,168 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,170 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,174 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,176 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,177 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,178 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,180 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:29,573 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:36:29,575 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:36:29,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:29,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:29,593 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-26 13:36:29,601 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-26 13:36:29,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:29,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:29,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:29,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:29,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:29,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:29,615 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-26 13:36:29,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:29,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:29,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:29,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:29,640 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-26 13:36:29,641 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-26 13:36:29,643 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-26 13:36:29,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:29,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:29,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:29,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:29,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:29,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:29,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:29,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:29,680 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-26 13:36:29,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:29,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:29,681 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-26 13:36:29,682 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-26 13:36:29,683 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-26 13:36:29,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:29,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:29,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:29,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:29,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:29,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:29,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:29,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:29,721 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-26 13:36:29,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:29,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:29,730 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-26 13:36:29,731 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-26 13:36:29,732 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-26 13:36:29,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:29,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:29,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:29,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:29,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:29,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:29,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:29,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-26 13:36:29,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:29,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:29,767 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-26 13:36:29,768 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-26 13:36:29,770 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-26 13:36:29,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:29,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:29,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:29,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:29,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:29,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:29,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:29,807 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-26 13:36:29,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:29,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:29,808 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-26 13:36:29,809 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-26 13:36:29,811 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-26 13:36:29,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:29,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:29,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:29,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:29,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:29,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:29,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:29,855 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-26 13:36:29,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:29,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:29,857 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-26 13:36:29,858 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-26 13:36:29,859 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-26 13:36:29,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:29,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:29,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:29,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:29,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:29,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:29,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:29,895 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-26 13:36:29,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:29,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:29,896 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-26 13:36:29,897 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-26 13:36:29,898 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-26 13:36:29,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:29,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:29,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:29,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:29,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:29,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:29,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:29,936 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-26 13:36:29,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:29,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:29,938 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-26 13:36:29,939 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-26 13:36:29,940 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-26 13:36:29,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:29,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:29,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:29,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:29,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:29,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:29,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:36:29,978 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-26 13:36:29,978 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-26 13:36:29,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:29,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:30,001 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-26 13:36:30,024 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:36:30,035 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-26 13:36:30,045 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 13:36:30,045 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:36:30,046 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-26 13:36:30,063 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-26 13:36:30,105 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-26 13:36:30,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:36:30,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:36:30,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:36:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:36:30,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 13:36:30,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:36:30,327 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-26 13:36:30,357 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-26 13:36:30,359 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-26 13:36:30,629 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-26 13:36:30,651 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-26 13:36:30,655 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-26 13:36:30,658 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-26 13:36:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 245 transitions. [2022-07-26 13:36:30,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 245 transitions. Stem has 43 letters. Loop has 6 letters. [2022-07-26 13:36:30,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:36:30,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 245 transitions. Stem has 49 letters. Loop has 6 letters. [2022-07-26 13:36:30,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:36:30,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 245 transitions. Stem has 43 letters. Loop has 12 letters. [2022-07-26 13:36:30,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:36:30,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6050 states and 20287 transitions. [2022-07-26 13:36:30,730 INFO L131 ngComponentsAnalysis]: Automaton has 216 accepting balls. 1520 [2022-07-26 13:36:30,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6050 states to 1783 states and 5709 transitions. [2022-07-26 13:36:30,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1775 [2022-07-26 13:36:30,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1777 [2022-07-26 13:36:30,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1783 states and 5709 transitions. [2022-07-26 13:36:30,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:36:30,756 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1783 states and 5709 transitions. [2022-07-26 13:36:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states and 5709 transitions. [2022-07-26 13:36:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1782. [2022-07-26 13:36:30,829 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-26 13:36:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 5708 transitions. [2022-07-26 13:36:30,839 INFO L242 hiAutomatonCegarLoop]: Abstraction has 1782 states and 5708 transitions. [2022-07-26 13:36:30,839 INFO L426 stractBuchiCegarLoop]: Abstraction has 1782 states and 5708 transitions. [2022-07-26 13:36:30,839 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 13:36:30,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1782 states and 5708 transitions. [2022-07-26 13:36:30,850 INFO L131 ngComponentsAnalysis]: Automaton has 216 accepting balls. 1520 [2022-07-26 13:36:30,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:36:30,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:36:30,853 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-26 13:36:30,853 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 13:36:30,856 INFO L733 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-26 13:36:30,856 INFO L735 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#[L90-4, L48]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-26 13:36:30,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1079450153, now seen corresponding path program 1 times [2022-07-26 13:36:30,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:30,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18782554] [2022-07-26 13:36:30,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:30,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:36:31,022 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-26 13:36:31,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:36:31,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18782554] [2022-07-26 13:36:31,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18782554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:36:31,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:36:31,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-26 13:36:31,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312147632] [2022-07-26 13:36:31,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:36:31,025 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 13:36:31,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:31,026 INFO L85 PathProgramCache]: Analyzing trace with hash 382739893, now seen corresponding path program 1 times [2022-07-26 13:36:31,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:31,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420344757] [2022-07-26 13:36:31,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:31,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:31,031 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:31,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:31,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:36:31,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-26 13:36:31,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-26 13:36:31,143 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-26 13:36:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:36:31,370 INFO L93 Difference]: Finished difference Result 1798 states and 5723 transitions. [2022-07-26 13:36:31,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1798 states and 5723 transitions. [2022-07-26 13:36:31,384 INFO L131 ngComponentsAnalysis]: Automaton has 216 accepting balls. 1520 [2022-07-26 13:36:31,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1798 states to 1786 states and 5711 transitions. [2022-07-26 13:36:31,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1776 [2022-07-26 13:36:31,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1776 [2022-07-26 13:36:31,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1786 states and 5711 transitions. [2022-07-26 13:36:31,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:36:31,441 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1786 states and 5711 transitions. [2022-07-26 13:36:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states and 5711 transitions. [2022-07-26 13:36:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1782. [2022-07-26 13:36:31,468 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-26 13:36:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 5707 transitions. [2022-07-26 13:36:31,474 INFO L242 hiAutomatonCegarLoop]: Abstraction has 1782 states and 5707 transitions. [2022-07-26 13:36:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-26 13:36:31,475 INFO L426 stractBuchiCegarLoop]: Abstraction has 1782 states and 5707 transitions. [2022-07-26 13:36:31,475 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 13:36:31,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1782 states and 5707 transitions. [2022-07-26 13:36:31,485 INFO L131 ngComponentsAnalysis]: Automaton has 216 accepting balls. 1520 [2022-07-26 13:36:31,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:36:31,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:36:31,486 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-26 13:36:31,486 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 13:36:31,487 INFO L733 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-26 13:36:31,488 INFO L735 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#[L90-4, L48]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-26 13:36:31,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:31,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1569912505, now seen corresponding path program 1 times [2022-07-26 13:36:31,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:31,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635196978] [2022-07-26 13:36:31,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:31,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:31,549 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:31,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:31,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:31,588 INFO L85 PathProgramCache]: Analyzing trace with hash 382739893, now seen corresponding path program 2 times [2022-07-26 13:36:31,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:31,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229559165] [2022-07-26 13:36:31,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:31,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:31,598 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:31,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:31,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:31,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1013712849, now seen corresponding path program 1 times [2022-07-26 13:36:31,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:31,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478292010] [2022-07-26 13:36:31,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:31,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:31,647 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:31,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:33,178 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:36:33,178 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:36:33,178 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:36:33,178 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:36:33,178 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:36:33,178 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:33,178 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:36:33,178 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:36:33,178 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-min-le-max.wvr.c_BEv2_Iteration3_Lasso [2022-07-26 13:36:33,178 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:36:33,178 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:36:33,182 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,190 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,192 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,194 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,195 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,196 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,197 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,198 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,200 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,200 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,748 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,750 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,751 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,752 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,753 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,754 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,755 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,756 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,758 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,759 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,760 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,761 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,762 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,763 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,764 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,765 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,770 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,772 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,774 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,775 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,776 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,777 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,778 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,779 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,780 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:33,781 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:34,189 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:36:34,189 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:36:34,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,193 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:36:34,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-26 13:36:34,196 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-26 13:36:34,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:34,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:34,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-26 13:36:34,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,232 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:36:34,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-26 13:36:34,234 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-26 13:36:34,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:34,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:34,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:34,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-26 13:36:34,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,264 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:36:34,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-26 13:36:34,265 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-26 13:36:34,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:34,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:34,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:34,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,301 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:36:34,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-26 13:36:34,303 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-26 13:36:34,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:34,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:34,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:34,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:34,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,329 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:36:34,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-26 13:36:34,332 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-26 13:36:34,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:34,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:34,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:34,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:34,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,359 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:36:34,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-26 13:36:34,361 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-26 13:36:34,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:34,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:34,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:34,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:34,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,388 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:36:34,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-26 13:36:34,390 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-26 13:36:34,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:34,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:34,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-26 13:36:34,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,419 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:36:34,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-26 13:36:34,423 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-26 13:36:34,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:34,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:34,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:34,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,477 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:36:34,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-26 13:36:34,479 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-26 13:36:34,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:34,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:34,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:34,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-26 13:36:34,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,505 INFO L229 MonitoredProcess]: Starting monitored process 21 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-26 13:36:34,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-26 13:36:34,535 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-26 13:36:34,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:34,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:34,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:34,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,564 INFO L229 MonitoredProcess]: Starting monitored process 22 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-26 13:36:34,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-26 13:36:34,566 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-26 13:36:34,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:34,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:34,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-26 13:36:34,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,591 INFO L229 MonitoredProcess]: Starting monitored process 23 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-26 13:36:34,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-26 13:36:34,593 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-26 13:36:34,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:34,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:34,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:34,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,619 INFO L229 MonitoredProcess]: Starting monitored process 24 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-26 13:36:34,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-26 13:36:34,622 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-26 13:36:34,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:34,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:34,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:34,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,657 INFO L229 MonitoredProcess]: Starting monitored process 25 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-26 13:36:34,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-26 13:36:34,662 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-26 13:36:34,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:34,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:34,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:34,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,689 INFO L229 MonitoredProcess]: Starting monitored process 26 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-26 13:36:34,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-26 13:36:34,690 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-26 13:36:34,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:34,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:34,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-26 13:36:34,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,717 INFO L229 MonitoredProcess]: Starting monitored process 27 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-26 13:36:34,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-26 13:36:34,720 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-26 13:36:34,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:34,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:34,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:34,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-26 13:36:34,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,779 INFO L229 MonitoredProcess]: Starting monitored process 28 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-26 13:36:34,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-26 13:36:34,781 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-26 13:36:34,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:34,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:34,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:34,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:34,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:34,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:34,803 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:36:34,832 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2022-07-26 13:36:34,833 INFO L444 ModelExtractionUtils]: 13 out of 37 variables were initially zero. Simplification set additionally 21 variables to zero. [2022-07-26 13:36:34,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:34,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:34,834 INFO L229 MonitoredProcess]: Starting monitored process 29 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-26 13:36:34,835 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:36:34,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-26 13:36:34,841 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 13:36:34,841 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:36:34,842 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_2, thread1Thread1of1ForFork0_~i~0) = 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_2 - 4*thread1Thread1of1ForFork0_~i~0 Supporting invariants [] [2022-07-26 13:36:34,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-26 13:36:34,988 INFO L156 tatePredicateManager]: 33 out of 36 supporting invariants were superfluous and have been removed [2022-07-26 13:36:35,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:36:35,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-26 13:36:35,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:36:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:36:35,286 WARN L261 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-26 13:36:35,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:36:35,368 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-26 13:36:35,369 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 4 loop predicates [2022-07-26 13:36:35,369 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1782 states and 5707 transitions. cyclomatic complexity: 4142 Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 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-26 13:36:35,634 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1782 states and 5707 transitions. cyclomatic complexity: 4142. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 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 4441 states and 16064 transitions. Complement of second has 16 states. [2022-07-26 13:36:35,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-26 13:36:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 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-26 13:36:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 221 transitions. [2022-07-26 13:36:35,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 221 transitions. Stem has 72 letters. Loop has 5 letters. [2022-07-26 13:36:35,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:36:35,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 221 transitions. Stem has 77 letters. Loop has 5 letters. [2022-07-26 13:36:35,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:36:35,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 221 transitions. Stem has 72 letters. Loop has 10 letters. [2022-07-26 13:36:35,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:36:35,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4441 states and 16064 transitions. [2022-07-26 13:36:35,675 INFO L131 ngComponentsAnalysis]: Automaton has 210 accepting balls. 1050 [2022-07-26 13:36:35,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4441 states to 2899 states and 10430 transitions. [2022-07-26 13:36:35,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1515 [2022-07-26 13:36:35,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2066 [2022-07-26 13:36:35,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2899 states and 10430 transitions. [2022-07-26 13:36:35,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:36:35,705 INFO L220 hiAutomatonCegarLoop]: Abstraction has 2899 states and 10430 transitions. [2022-07-26 13:36:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states and 10430 transitions. [2022-07-26 13:36:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2350. [2022-07-26 13:36:35,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 2350 states have (on average 3.606382978723404) internal successors, (8475), 2349 states have internal predecessors, (8475), 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-26 13:36:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 8475 transitions. [2022-07-26 13:36:35,815 INFO L242 hiAutomatonCegarLoop]: Abstraction has 2350 states and 8475 transitions. [2022-07-26 13:36:35,815 INFO L426 stractBuchiCegarLoop]: Abstraction has 2350 states and 8475 transitions. [2022-07-26 13:36:35,815 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 13:36:35,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2350 states and 8475 transitions. [2022-07-26 13:36:35,824 INFO L131 ngComponentsAnalysis]: Automaton has 210 accepting balls. 1050 [2022-07-26 13:36:35,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:36:35,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:36:35,825 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, 1, 1, 1, 1, 1, 1] [2022-07-26 13:36:35,825 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 13:36:35,827 INFO L733 eck$LassoCheckResult]: Stem: 28287#[ULTIMATE.startENTRY]don't care [350] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 28289#[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] 28295#[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[] 28297#[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[] 28927#[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[] 28839#[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[] 26391#[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[] 26393#[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[] 28535#[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] 28537#[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] 28731#[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] 28733#[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] 27451#[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] 27453#[L-1-3]don't care [364] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24853#[L-1-4]don't care [267] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24855#[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] 26925#[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] 26927#[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] 26987#[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] 26281#[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] 24805#[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] 24807#[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] 28199#[L83]don't care [243] L83-->L83-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 28417#[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] 25695#[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] 25697#[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] 28637#[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] 28867#[L104]don't care [239] L104-->L104-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 27105#[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] 27107#[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] 28313#[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] 24951#[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[] 24953#[L36-1]don't care [345] L36-1-->L105: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 28833#[L105]don't care [238] L105-->L105-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 28995#[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] 28443#[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] 26905#[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] 26907#[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[] 27359#[L36-3]don't care [303] L36-3-->L107: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 28651#[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] 28653#[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] 28765#[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] 24585#[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] 24587#[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[] 27795#[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] 27797#[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] 24423#[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] 24425#[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] 26203#[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] 26207#[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[] 28969#[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] 28705#[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] 28119#[L83-4]don't care [294] L83-4-->L83-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 28121#[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] 28431#[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] 28437#[L85]don't care [259] L85-->L85-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 28439#[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] 25913#[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] 25915#[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] 26209#[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[] 28461#[L36-5]don't care [269] L36-5-->L86: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 28463#[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] 28913#[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] 27907#[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] 27443#[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] 27445#[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] 24411#[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] 24413#[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] 27971#[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] 26237#[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] 26239#[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] 28335#[thread1ENTRY, L90-4]don't care [344] L90-4-->L90-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 28339#[thread1ENTRY, L90-5]don't care [256] L90-5-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] 28301#[thread1ENTRY, L91]don't care [245] L91-->L91-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 26091#[thread1ENTRY, L91-1]don't care [258] L91-1-->L91-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 26095#[thread1ENTRY, L91-2]don't care [300] L91-2-->L91-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre13#1_3|)) |v_#memory_int_13|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_19| |v_ULTIMATE.start_main_~#t2~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_14|, #length=|v_#length_19|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 28963#[thread1ENTRY, L91-3]don't care [396] L91-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_14, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_8|, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 28847#[L91-4, thread1ENTRY, thread2ENTRY]don't care [378] thread2ENTRY-->L59-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] 28853#[L91-4, thread1ENTRY, L59-4]don't care [2022-07-26 13:36:35,827 INFO L735 eck$LassoCheckResult]: Loop: 28853#[L91-4, thread1ENTRY, L59-4]don't care [381] L59-4-->L60: Formula: (< v_thread2Thread1of1ForFork1_~i~1_5 v_~N~0_4) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[] 28269#[L91-4, thread1ENTRY, L60]don't care [383] L60-->L61-4: Formula: (let ((.cse6 (* v_thread2Thread1of1ForFork1_~i~1_7 4))) (let ((.cse5 (+ .cse6 v_~A~0.offset_25))) (let ((.cse1 (= (select |v_#valid_47| v_~A~0.base_25) 1)) (.cse2 (<= (+ .cse6 v_~A~0.offset_25 4) (select |v_#length_40| v_~A~0.base_25))) (.cse4 (<= 0 .cse5))) (and (let ((.cse0 (select (select |v_#memory_int_36| v_~A~0.base_25) .cse5))) (let ((.cse3 (< v_~max~0_18 .cse0))) (or (and (= .cse0 v_~max~0_17) .cse1 .cse2 .cse3 .cse4) (and (not .cse3) (= |v_thread2Thread1of1ForFork1_#t~mem6_2| |v_thread2Thread1of1ForFork1_#t~mem6_1|) (= v_~max~0_18 v_~max~0_17))))) .cse1 .cse2 .cse4)))) InVars {~A~0.base=v_~A~0.base_25, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_7, ~A~0.offset=v_~A~0.offset_25, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_1|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_36|, ~max~0=v_~max~0_18, #length=|v_#length_40|} OutVars{~A~0.base=v_~A~0.base_25, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_7, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_1|, ~A~0.offset=v_~A~0.offset_25, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_2|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_36|, ~max~0=v_~max~0_17, #length=|v_#length_40|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max~0] 28273#[L61-4, L91-4, thread1ENTRY]don't care [385] L61-4-->L59-2: Formula: (= |v_thread2Thread1of1ForFork1_#t~post4_1| v_thread2Thread1of1ForFork1_~i~1_9) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_9} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_9, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4] 25537#[L91-4, thread1ENTRY, L59-2]don't care [386] L59-2-->L59-3: Formula: (= v_thread2Thread1of1ForFork1_~i~1_11 (+ |v_thread2Thread1of1ForFork1_#t~post4_3| 1)) InVars {thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_3|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_11, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] 25541#[L59-3, L91-4, thread1ENTRY]don't care [387] L59-3-->L59-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4] 28853#[L91-4, thread1ENTRY, L59-4]don't care [2022-07-26 13:36:35,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:35,827 INFO L85 PathProgramCache]: Analyzing trace with hash -304732484, now seen corresponding path program 1 times [2022-07-26 13:36:35,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:35,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880984972] [2022-07-26 13:36:35,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:35,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:35,846 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:35,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:35,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:35,864 INFO L85 PathProgramCache]: Analyzing trace with hash 392282943, now seen corresponding path program 1 times [2022-07-26 13:36:35,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:35,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620254604] [2022-07-26 13:36:35,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:35,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:35,867 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:35,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:35,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:35,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1988991332, now seen corresponding path program 1 times [2022-07-26 13:36:35,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:35,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297865366] [2022-07-26 13:36:35,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:35,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:35,885 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:35,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:37,372 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:36:37,372 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:36:37,372 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:36:37,372 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:36:37,372 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:36:37,372 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:37,372 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:36:37,372 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:36:37,372 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-min-le-max.wvr.c_BEv2_Iteration4_Lasso [2022-07-26 13:36:37,372 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:36:37,373 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:36:37,377 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,051 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,053 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,056 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,057 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,058 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,060 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,061 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,062 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,064 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,065 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,067 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,069 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,070 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,072 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,073 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,074 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,076 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,077 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,079 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,080 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,082 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,083 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,085 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,086 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,087 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,089 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,090 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,093 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,095 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,096 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,098 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,099 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,100 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,102 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,103 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,105 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,106 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,107 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,109 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,110 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,111 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,113 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:38,632 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:36:38,632 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:36:38,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:38,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:38,633 INFO L229 MonitoredProcess]: Starting monitored process 30 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-26 13:36:38,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-26 13:36:38,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-26 13:36:38,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:38,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:38,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:38,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:38,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:38,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:38,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:38,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:38,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:38,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:38,663 INFO L229 MonitoredProcess]: Starting monitored process 31 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-26 13:36:38,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-26 13:36:38,665 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-26 13:36:38,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:38,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:38,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:38,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:38,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:38,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:38,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:38,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:38,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:38,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:38,692 INFO L229 MonitoredProcess]: Starting monitored process 32 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-26 13:36:38,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-26 13:36:38,695 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-26 13:36:38,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:38,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:38,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:38,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:38,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:38,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:38,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:38,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-26 13:36:38,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:38,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:38,727 INFO L229 MonitoredProcess]: Starting monitored process 33 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-26 13:36:38,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-26 13:36:38,729 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-26 13:36:38,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:38,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:38,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:38,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:38,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:38,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:38,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:38,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-26 13:36:38,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:38,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:38,761 INFO L229 MonitoredProcess]: Starting monitored process 34 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-26 13:36:38,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-26 13:36:38,764 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-26 13:36:38,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:38,770 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-26 13:36:38,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:38,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:38,774 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-26 13:36:38,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:38,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:38,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-26 13:36:38,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:38,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:38,806 INFO L229 MonitoredProcess]: Starting monitored process 35 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-26 13:36:38,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-26 13:36:38,808 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-26 13:36:38,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:38,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:38,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:38,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:38,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:38,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:38,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:38,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-26 13:36:38,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:38,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:38,848 INFO L229 MonitoredProcess]: Starting monitored process 36 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-26 13:36:38,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-26 13:36:38,850 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-26 13:36:38,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:38,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:38,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:38,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:38,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:38,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:38,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:38,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-26 13:36:38,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:38,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:38,877 INFO L229 MonitoredProcess]: Starting monitored process 37 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-26 13:36:38,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-26 13:36:38,879 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-26 13:36:38,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:38,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:38,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:38,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:38,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:38,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:38,903 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:36:38,929 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2022-07-26 13:36:38,929 INFO L444 ModelExtractionUtils]: 21 out of 40 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-07-26 13:36:38,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:38,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:38,930 INFO L229 MonitoredProcess]: Starting monitored process 38 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-26 13:36:38,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-26 13:36:38,932 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:36:38,945 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 13:36:38,945 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:36:38,945 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_~i~1, ~N~0) = -1*thread2Thread1of1ForFork1_~i~1 + 1*~N~0 Supporting invariants [] [2022-07-26 13:36:38,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-26 13:36:39,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:39,072 INFO L156 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2022-07-26 13:36:39,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:36:39,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:36:39,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:36:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:36:39,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 13:36:39,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:36:39,214 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-26 13:36:39,216 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-26 13:36:39,216 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2350 states and 8475 transitions. cyclomatic complexity: 6386 Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-26 13:36:39,351 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2350 states and 8475 transitions. cyclomatic complexity: 6386. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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 6724 states and 26621 transitions. Complement of second has 8 states. [2022-07-26 13:36:39,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-26 13:36:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-26 13:36:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2022-07-26 13:36:39,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 205 transitions. Stem has 78 letters. Loop has 5 letters. [2022-07-26 13:36:39,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:36:39,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 205 transitions. Stem has 83 letters. Loop has 5 letters. [2022-07-26 13:36:39,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:36:39,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 205 transitions. Stem has 78 letters. Loop has 10 letters. [2022-07-26 13:36:39,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:36:39,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6724 states and 26621 transitions. [2022-07-26 13:36:39,417 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 13:36:39,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6724 states to 0 states and 0 transitions. [2022-07-26 13:36:39,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-26 13:36:39,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-26 13:36:39,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-26 13:36:39,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:36:39,418 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:36:39,418 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:36:39,418 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:36:39,418 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 13:36:39,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-26 13:36:39,418 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 13:36:39,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-26 13:36:39,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 01:36:39 BoogieIcfgContainer [2022-07-26 13:36:39,423 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 13:36:39,423 INFO L158 Benchmark]: Toolchain (without parser) took 13038.92ms. Allocated memory was 187.7MB in the beginning and 382.7MB in the end (delta: 195.0MB). Free memory was 137.2MB in the beginning and 226.8MB in the end (delta: -89.7MB). Peak memory consumption was 106.8MB. Max. memory is 8.0GB. [2022-07-26 13:36:39,424 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 13:36:39,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.63ms. Allocated memory is still 187.7MB. Free memory was 136.9MB in the beginning and 161.3MB in the end (delta: -24.4MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-07-26 13:36:39,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.47ms. Allocated memory is still 187.7MB. Free memory was 161.3MB in the beginning and 159.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 13:36:39,424 INFO L158 Benchmark]: Boogie Preprocessor took 31.46ms. Allocated memory is still 187.7MB. Free memory was 159.4MB in the beginning and 157.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 13:36:39,424 INFO L158 Benchmark]: RCFGBuilder took 363.69ms. Allocated memory is still 187.7MB. Free memory was 157.8MB in the beginning and 139.3MB in the end (delta: 18.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-07-26 13:36:39,424 INFO L158 Benchmark]: BuchiAutomizer took 12255.89ms. Allocated memory was 187.7MB in the beginning and 382.7MB in the end (delta: 195.0MB). Free memory was 138.9MB in the beginning and 226.8MB in the end (delta: -88.0MB). Peak memory consumption was 108.0MB. Max. memory is 8.0GB. [2022-07-26 13:36:39,425 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.10ms. Allocated memory is still 187.7MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 343.63ms. Allocated memory is still 187.7MB. Free memory was 136.9MB in the beginning and 161.3MB in the end (delta: -24.4MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.47ms. Allocated memory is still 187.7MB. Free memory was 161.3MB in the beginning and 159.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.46ms. Allocated memory is still 187.7MB. Free memory was 159.4MB in the beginning and 157.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 363.69ms. Allocated memory is still 187.7MB. Free memory was 157.8MB in the beginning and 139.3MB in the end (delta: 18.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 12255.89ms. Allocated memory was 187.7MB in the beginning and 382.7MB in the end (delta: 195.0MB). Free memory was 138.9MB in the beginning and 226.8MB in the end (delta: -88.0MB). Peak memory consumption was 108.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * arr + unknown-#length-unknown[arr] and consists of 6 locations. One deterministic module has affine ranking function i * -4 + unknown-#length-unknown[arr] and consists of 13 locations. One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 9.5s. Construction of modules took 0.2s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 554 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 768 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 766 mSDsluCounter, 1635 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1216 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 467 IncrementalHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 500 mSDtfsCounter, 467 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital319 mio100 ax111 hnf100 lsp87 ukn67 mio100 lsp36 div122 bol100 ite100 ukn100 eq175 hnf91 smp81 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 7 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-26 13:36:39,460 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...