/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-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:25:17,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:25:17,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:25:17,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:25:17,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:25:17,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:25:17,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:25:17,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:25:17,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:25:17,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:25:17,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:25:17,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:25:17,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:25:17,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:25:17,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:25:17,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:25:17,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:25:17,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:25:17,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:25:17,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:25:17,923 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:25:17,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:25:17,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:25:17,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:25:17,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:25:17,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:25:17,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:25:17,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:25:17,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:25:17,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:25:17,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:25:17,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:25:17,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:25:17,950 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:25:17,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:25:17,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:25:17,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:25:17,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:25:17,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:25:17,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:25:17,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:25:17,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:25:17,964 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:25:18,008 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:25:18,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:25:18,008 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:25:18,009 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:25:18,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:25:18,010 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:25:18,011 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:25:18,011 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:25:18,011 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:25:18,011 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:25:18,012 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:25:18,012 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:25:18,012 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:25:18,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:25:18,012 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:25:18,013 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:25:18,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:25:18,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:25:18,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:25:18,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:25:18,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:25:18,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:25:18,014 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:25:18,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:25:18,015 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:25:18,015 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:25:18,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:25:18,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:25:18,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:25:18,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:25:18,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:25:18,017 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:25:18,018 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-22 12:25:18,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:25:18,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:25:18,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:25:18,456 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:25:18,457 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:25:18,459 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2022-07-22 12:25:18,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06fb3c417/5183b68961dc430b9f2a6df7a25f9e33/FLAGdaf74c0d6 [2022-07-22 12:25:19,158 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:25:19,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2022-07-22 12:25:19,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06fb3c417/5183b68961dc430b9f2a6df7a25f9e33/FLAGdaf74c0d6 [2022-07-22 12:25:19,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06fb3c417/5183b68961dc430b9f2a6df7a25f9e33 [2022-07-22 12:25:19,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:25:19,206 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:25:19,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:25:19,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:25:19,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:25:19,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:25:19" (1/1) ... [2022-07-22 12:25:19,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64975217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:19, skipping insertion in model container [2022-07-22 12:25:19,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:25:19" (1/1) ... [2022-07-22 12:25:19,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:25:19,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:25:19,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-07-22 12:25:19,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:25:19,628 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:25:19,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-07-22 12:25:19,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:25:19,714 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:25:19,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:19 WrapperNode [2022-07-22 12:25:19,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:25:19,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:25:19,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:25:19,717 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:25:19,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:19" (1/1) ... [2022-07-22 12:25:19,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:19" (1/1) ... [2022-07-22 12:25:19,801 INFO L137 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 120 [2022-07-22 12:25:19,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:25:19,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:25:19,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:25:19,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:25:19,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:19" (1/1) ... [2022-07-22 12:25:19,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:19" (1/1) ... [2022-07-22 12:25:19,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:19" (1/1) ... [2022-07-22 12:25:19,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:19" (1/1) ... [2022-07-22 12:25:19,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:19" (1/1) ... [2022-07-22 12:25:19,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:19" (1/1) ... [2022-07-22 12:25:19,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:19" (1/1) ... [2022-07-22 12:25:19,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:25:19,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:25:19,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:25:19,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:25:19,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:19" (1/1) ... [2022-07-22 12:25:19,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:19,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:19,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:19,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 12:25:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:25:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:25:20,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:25:20,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:25:20,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:25:20,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:25:20,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:25:20,005 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:25:20,005 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:25:20,005 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:25:20,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:25:20,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:25:20,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:25:20,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:25:20,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:25:20,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:25:20,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:25:20,008 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:25:20,106 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:25:20,109 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:25:20,565 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:25:20,642 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:25:20,644 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-22 12:25:20,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:25:20 BoogieIcfgContainer [2022-07-22 12:25:20,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:25:20,648 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:25:20,648 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:25:20,652 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:25:20,653 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:25:20,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:25:19" (1/3) ... [2022-07-22 12:25:20,659 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@555d86e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:25:20, skipping insertion in model container [2022-07-22 12:25:20,659 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:25:20,659 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:19" (2/3) ... [2022-07-22 12:25:20,660 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@555d86e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:25:20, skipping insertion in model container [2022-07-22 12:25:20,660 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:25:20,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:25:20" (3/3) ... [2022-07-22 12:25:20,662 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2022-07-22 12:25:20,788 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 12:25:20,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 178 places, 187 transitions, 398 flow [2022-07-22 12:25:20,904 INFO L129 PetriNetUnfolder]: 16/181 cut-off events. [2022-07-22 12:25:20,905 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:25:20,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 181 events. 16/181 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 141. Up to 3 conditions per place. [2022-07-22 12:25:20,912 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 187 transitions, 398 flow [2022-07-22 12:25:20,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 181 transitions, 380 flow [2022-07-22 12:25:20,933 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:25:20,955 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 181 transitions, 380 flow [2022-07-22 12:25:20,960 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 181 transitions, 380 flow [2022-07-22 12:25:20,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 181 transitions, 380 flow [2022-07-22 12:25:21,058 INFO L129 PetriNetUnfolder]: 16/181 cut-off events. [2022-07-22 12:25:21,059 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:25:21,063 INFO L84 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 181 events. 16/181 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 141. Up to 3 conditions per place. [2022-07-22 12:25:21,067 INFO L116 LiptonReduction]: Number of co-enabled transitions 1720 [2022-07-22 12:25:27,759 INFO L131 LiptonReduction]: Checked pairs total: 2482 [2022-07-22 12:25:27,760 INFO L133 LiptonReduction]: Total number of compositions: 186 [2022-07-22 12:25:27,784 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:25:27,785 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:25:27,785 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:25:27,785 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:25:27,785 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:25:27,785 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:25:27,785 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:25:27,786 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:25:27,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:25:27,872 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 128 [2022-07-22 12:25:27,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:27,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:27,879 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:25:27,880 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:27,880 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:25:27,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 171 states, but on-demand construction may add more states [2022-07-22 12:25:27,903 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 128 [2022-07-22 12:25:27,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:27,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:27,903 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:25:27,904 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:27,914 INFO L748 eck$LassoCheckResult]: Stem: 181#[ULTIMATE.startENTRY]don't care [676] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_1| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= v_~C~0.offset_Out_2 0) (= (select |v_#valid_In_3| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= v_~asum~0_Out_2 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6| 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_In_3| 1) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_10|) (= v_~p~0_Out_2 0) (= (select |v_#length_In_3| 2) 30) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_3| 1)) (= |v_#length_Out_6| (store (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| v_~N~0_Out_2) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~A~0.offset_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~C~0.base_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= v_~csum~0_Out_2 0))))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~C~0.base=v_~C~0.base_Out_2, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ~asum~0=v_~asum~0_Out_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ~C~0.offset=v_~C~0.offset_Out_2, ~p~0=v_~p~0_Out_2, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_Out_10|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_10|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, ~csum~0=v_~csum~0_Out_2, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~size#1, ~C~0.base, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_main_#t~pre14#1, ~asum~0, ULTIMATE.start_main_#t~nondet7#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~csum~0, ~C~0.offset, ~p~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 184#[L113-6]don't care [2022-07-22 12:25:27,915 INFO L750 eck$LassoCheckResult]: Loop: 184#[L113-6]don't care [641] L113-6-->L113-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse0 4) (select |v_#length_155| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|)) (<= 0 .cse1) (= (select |v_#valid_188| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) 1) (= (store |v_#memory_int_154| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57| (store (select |v_#memory_int_154| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) .cse1 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|)) |v_#memory_int_153|) (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_154|, #length=|v_#length_155|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_153|, #length=|v_#length_155|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_35|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 184#[L113-6]don't care [2022-07-22 12:25:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:27,920 INFO L85 PathProgramCache]: Analyzing trace with hash 707, now seen corresponding path program 1 times [2022-07-22 12:25:27,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:27,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452342936] [2022-07-22 12:25:27,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:27,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:28,083 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:28,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:28,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:28,193 INFO L85 PathProgramCache]: Analyzing trace with hash 672, now seen corresponding path program 1 times [2022-07-22 12:25:28,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:28,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243950182] [2022-07-22 12:25:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:28,224 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:28,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:28,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash 22558, now seen corresponding path program 1 times [2022-07-22 12:25:28,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:28,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70920550] [2022-07-22 12:25:28,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:28,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:28,321 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:28,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:29,204 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:29,205 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:29,205 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:29,205 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:29,205 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:29,205 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,205 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:29,206 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:29,206 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-simple-array-sum.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:25:29,206 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:29,206 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:29,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:29,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:30,170 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:25:30,175 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:25:30,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:30,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:30,178 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:30,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 12:25:30,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:30,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:30,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:30,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:30,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:30,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:30,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:30,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:30,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:30,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:30,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:30,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:30,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 12:25:30,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:30,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:30,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:30,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:30,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:30,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:30,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:30,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:30,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:30,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:30,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:30,330 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:30,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:30,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 12:25:30,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:30,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:30,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:30,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:30,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:30,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:30,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:30,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:30,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:30,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:30,403 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:30,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 12:25:30,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:30,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:30,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:30,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:30,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:30,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:30,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:30,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:30,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:30,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:30,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:30,452 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:30,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 12:25:30,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:30,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:30,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:30,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:30,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:30,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:30,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:30,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:30,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:30,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:30,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:30,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:30,508 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:30,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 12:25:30,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:30,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:30,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:30,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:30,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:30,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:30,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:30,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:30,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-22 12:25:30,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:30,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:30,559 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:30,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 12:25:30,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:30,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:30,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:30,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:30,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:30,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:30,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:30,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:30,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:30,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:30,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:30,628 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:30,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 12:25:30,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:30,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:30,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:30,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:30,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:30,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:30,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:30,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:30,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:30,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:30,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:30,704 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:30,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 12:25:30,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:30,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:30,713 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:25:30,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:30,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:30,717 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:25:30,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:30,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:30,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:30,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:30,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:30,780 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:30,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:30,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:25:30,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:30,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:30,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:30,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:30,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:30,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:30,813 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:30,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:30,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:30,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:30,840 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:30,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:25:30,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:30,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:30,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:30,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:30,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:30,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:30,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:30,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:30,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:30,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:30,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:30,879 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:30,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:25:30,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:30,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:30,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:30,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:30,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:30,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:30,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:30,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:30,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:30,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:30,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:30,921 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:30,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:30,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:25:30,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:30,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:30,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:30,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:30,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:30,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:30,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:30,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-22 12:25:30,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:30,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:30,960 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:30,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:25:30,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:30,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:30,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:30,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:30,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:30,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:30,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:30,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:30,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:30,995 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-22 12:25:30,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:30,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:30,997 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:30,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:25:30,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:31,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:31,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:31,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:31,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:31,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:31,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:31,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:31,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:31,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:31,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:31,041 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:31,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:25:31,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:31,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:31,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:31,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:31,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:31,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:31,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:31,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:31,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:31,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:31,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:31,080 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:31,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:25:31,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:31,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:31,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:31,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:31,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:31,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:31,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:31,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:31,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:31,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:31,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:31,128 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:31,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:25:31,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:31,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:31,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:31,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:31,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:31,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:31,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:31,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:31,166 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-22 12:25:31,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:31,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:31,167 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:31,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:31,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:25:31,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:31,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:31,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:31,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:31,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:31,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:31,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:31,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-22 12:25:31,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:31,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:31,207 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-22 12:25:31,209 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-22 12:25:31,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:31,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:31,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:31,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:31,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:31,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:31,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:31,254 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:25:31,296 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-22 12:25:31,296 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-22 12:25:31,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:31,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:31,308 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-22 12:25:31,348 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:25:31,357 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-22 12:25:31,367 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:25:31,368 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:25:31,369 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base)_1 - 4*ULTIMATE.start_create_fresh_uint_array_~i~3#1 - 1*ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset Supporting invariants [] [2022-07-22 12:25:31,469 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-22 12:25:31,557 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 12:25:31,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:31,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:25:31,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:31,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:25:31,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:25:31,682 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:25:31,685 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 171 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:31,762 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 171 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 174 states and 578 transitions. Complement of second has 3 states. [2022-07-22 12:25:31,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:25:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:25:31,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:25:31,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:31,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:25:31,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:31,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:25:31,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:31,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 578 transitions. [2022-07-22 12:25:31,799 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 127 [2022-07-22 12:25:31,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 166 states and 559 transitions. [2022-07-22 12:25:31,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2022-07-22 12:25:31,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 165 [2022-07-22 12:25:31,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 559 transitions. [2022-07-22 12:25:31,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:31,857 INFO L220 hiAutomatonCegarLoop]: Abstraction has 166 states and 559 transitions. [2022-07-22 12:25:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 559 transitions. [2022-07-22 12:25:31,907 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-22 12:25:31,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2022-07-22 12:25:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 165 states have (on average 3.375757575757576) internal successors, (557), 164 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 557 transitions. [2022-07-22 12:25:31,933 INFO L242 hiAutomatonCegarLoop]: Abstraction has 165 states and 557 transitions. [2022-07-22 12:25:31,933 INFO L425 stractBuchiCegarLoop]: Abstraction has 165 states and 557 transitions. [2022-07-22 12:25:31,933 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:25:31,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 557 transitions. [2022-07-22 12:25:31,937 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 127 [2022-07-22 12:25:31,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:31,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:31,937 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 12:25:31,938 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:31,939 INFO L748 eck$LassoCheckResult]: Stem: 1130#[ULTIMATE.startENTRY]don't care [676] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_1| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= v_~C~0.offset_Out_2 0) (= (select |v_#valid_In_3| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= v_~asum~0_Out_2 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6| 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_In_3| 1) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_10|) (= v_~p~0_Out_2 0) (= (select |v_#length_In_3| 2) 30) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_3| 1)) (= |v_#length_Out_6| (store (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| v_~N~0_Out_2) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~A~0.offset_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~C~0.base_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= v_~csum~0_Out_2 0))))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~C~0.base=v_~C~0.base_Out_2, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ~asum~0=v_~asum~0_Out_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ~C~0.offset=v_~C~0.offset_Out_2, ~p~0=v_~p~0_Out_2, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_Out_10|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_10|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, ~csum~0=v_~csum~0_Out_2, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~size#1, ~C~0.base, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_main_#t~pre14#1, ~asum~0, ULTIMATE.start_main_#t~nondet7#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~csum~0, ~C~0.offset, ~p~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 900#[L113-6]don't care [675] L113-6-->L113-14: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|)) (= (store |v_#valid_275| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 1) |v_#valid_274|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4)) |v_#length_221|) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 0)) (= v_~N~0_122 |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= v_~A~0.base_81 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= (select |v_#valid_275| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|) 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| |v_#StackHeapBarrier_53|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94| v_~A~0.offset_81)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_53|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|, #valid=|v_#valid_275|, #length=|v_#length_222|, ~N~0=v_~N~0_122, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94|} OutVars{~A~0.base=v_~A~0.base_81, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_59|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_57|, ~N~0=v_~N~0_122, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_37|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_57|, #StackHeapBarrier=|v_#StackHeapBarrier_53|, ~A~0.offset=v_~A~0.offset_81, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, #valid=|v_#valid_274|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_59|, #length=|v_#length_221|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ~A~0.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 834#[L113-14]don't care [2022-07-22 12:25:31,940 INFO L750 eck$LassoCheckResult]: Loop: 834#[L113-14]don't care [636] L113-14-->L113-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|) (= (store |v_#memory_int_140| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51| (store (select |v_#memory_int_140| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|)) |v_#memory_int_139|) (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|)) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|) (<= 0 .cse0) (= (select |v_#valid_174| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_140|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_139|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_33|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 834#[L113-14]don't care [2022-07-22 12:25:31,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:31,941 INFO L85 PathProgramCache]: Analyzing trace with hash 22592, now seen corresponding path program 1 times [2022-07-22 12:25:31,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:31,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99424195] [2022-07-22 12:25:31,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:31,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:31,975 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:32,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:32,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:32,007 INFO L85 PathProgramCache]: Analyzing trace with hash 667, now seen corresponding path program 1 times [2022-07-22 12:25:32,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:32,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427798778] [2022-07-22 12:25:32,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:32,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:32,016 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:32,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:32,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:32,022 INFO L85 PathProgramCache]: Analyzing trace with hash 700988, now seen corresponding path program 1 times [2022-07-22 12:25:32,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:32,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150701953] [2022-07-22 12:25:32,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:32,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:25:32,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:32,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150701953] [2022-07-22 12:25:32,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150701953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:25:32,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:25:32,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:25:32,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236023084] [2022-07-22 12:25:32,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:25:32,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:32,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:25:32,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:25:32,173 INFO L87 Difference]: Start difference. First operand 165 states and 557 transitions. cyclomatic complexity: 456 Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:32,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:32,383 INFO L93 Difference]: Finished difference Result 489 states and 1660 transitions. [2022-07-22 12:25:32,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 489 states and 1660 transitions. [2022-07-22 12:25:32,395 INFO L131 ngComponentsAnalysis]: Automaton has 187 accepting balls. 379 [2022-07-22 12:25:32,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 489 states to 489 states and 1660 transitions. [2022-07-22 12:25:32,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 488 [2022-07-22 12:25:32,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 488 [2022-07-22 12:25:32,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 489 states and 1660 transitions. [2022-07-22 12:25:32,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:32,424 INFO L220 hiAutomatonCegarLoop]: Abstraction has 489 states and 1660 transitions. [2022-07-22 12:25:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states and 1660 transitions. [2022-07-22 12:25:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 166. [2022-07-22 12:25:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 166 states have (on average 3.36144578313253) internal successors, (558), 165 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 558 transitions. [2022-07-22 12:25:32,467 INFO L242 hiAutomatonCegarLoop]: Abstraction has 166 states and 558 transitions. [2022-07-22 12:25:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:25:32,469 INFO L425 stractBuchiCegarLoop]: Abstraction has 166 states and 558 transitions. [2022-07-22 12:25:32,469 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:25:32,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 558 transitions. [2022-07-22 12:25:32,472 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 127 [2022-07-22 12:25:32,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:32,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:32,472 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:25:32,472 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:32,473 INFO L748 eck$LassoCheckResult]: Stem: 1962#[ULTIMATE.startENTRY]don't care [676] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_1| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= v_~C~0.offset_Out_2 0) (= (select |v_#valid_In_3| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= v_~asum~0_Out_2 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6| 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_In_3| 1) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_10|) (= v_~p~0_Out_2 0) (= (select |v_#length_In_3| 2) 30) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_3| 1)) (= |v_#length_Out_6| (store (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| v_~N~0_Out_2) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~A~0.offset_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~C~0.base_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= v_~csum~0_Out_2 0))))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~C~0.base=v_~C~0.base_Out_2, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ~asum~0=v_~asum~0_Out_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ~C~0.offset=v_~C~0.offset_Out_2, ~p~0=v_~p~0_Out_2, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_Out_10|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_10|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, ~csum~0=v_~csum~0_Out_2, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~size#1, ~C~0.base, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_main_#t~pre14#1, ~asum~0, ULTIMATE.start_main_#t~nondet7#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~csum~0, ~C~0.offset, ~p~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1730#[L113-6]don't care [641] L113-6-->L113-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse0 4) (select |v_#length_155| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|)) (<= 0 .cse1) (= (select |v_#valid_188| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) 1) (= (store |v_#memory_int_154| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57| (store (select |v_#memory_int_154| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) .cse1 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|)) |v_#memory_int_153|) (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_154|, #length=|v_#length_155|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_153|, #length=|v_#length_155|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_35|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 1732#[L113-6]don't care [675] L113-6-->L113-14: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|)) (= (store |v_#valid_275| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 1) |v_#valid_274|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4)) |v_#length_221|) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 0)) (= v_~N~0_122 |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= v_~A~0.base_81 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= (select |v_#valid_275| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|) 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| |v_#StackHeapBarrier_53|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94| v_~A~0.offset_81)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_53|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|, #valid=|v_#valid_275|, #length=|v_#length_222|, ~N~0=v_~N~0_122, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94|} OutVars{~A~0.base=v_~A~0.base_81, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_59|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_57|, ~N~0=v_~N~0_122, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_37|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_57|, #StackHeapBarrier=|v_#StackHeapBarrier_53|, ~A~0.offset=v_~A~0.offset_81, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, #valid=|v_#valid_274|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_59|, #length=|v_#length_221|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ~A~0.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1734#[L113-14]don't care [2022-07-22 12:25:32,474 INFO L750 eck$LassoCheckResult]: Loop: 1734#[L113-14]don't care [636] L113-14-->L113-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|) (= (store |v_#memory_int_140| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51| (store (select |v_#memory_int_140| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|)) |v_#memory_int_139|) (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|)) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|) (<= 0 .cse0) (= (select |v_#valid_174| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_140|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_139|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_33|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 1734#[L113-14]don't care [2022-07-22 12:25:32,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:32,474 INFO L85 PathProgramCache]: Analyzing trace with hash 699973, now seen corresponding path program 1 times [2022-07-22 12:25:32,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:32,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815903771] [2022-07-22 12:25:32,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:32,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:32,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:32,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:32,610 INFO L85 PathProgramCache]: Analyzing trace with hash 667, now seen corresponding path program 2 times [2022-07-22 12:25:32,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:32,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342089371] [2022-07-22 12:25:32,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:32,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:32,616 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:32,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:32,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash 21699799, now seen corresponding path program 1 times [2022-07-22 12:25:32,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:32,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262499749] [2022-07-22 12:25:32,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:32,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:32,663 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:32,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:34,636 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:34,636 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:34,636 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:34,637 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:34,637 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:34,637 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:34,637 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:34,637 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:34,637 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-simple-array-sum.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:25:34,637 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:34,637 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:34,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:34,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:34,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:34,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:35,884 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:25:35,884 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:25:35,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:35,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:35,890 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-22 12:25:35,891 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-22 12:25:35,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:35,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:35,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:35,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:35,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:35,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:35,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:35,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:35,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:35,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 12:25:35,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:35,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:35,927 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-22 12:25:35,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:35,931 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-22 12:25:35,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:35,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:35,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:35,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:35,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:35,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:35,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:35,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:35,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-22 12:25:35,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:35,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:35,963 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-22 12:25:35,966 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-22 12:25:35,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:35,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:35,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:35,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:35,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:35,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:35,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:35,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:36,005 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-22 12:25:36,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:36,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:36,009 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-22 12:25:36,009 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-22 12:25:36,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:36,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:36,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:36,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:36,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:36,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:36,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:36,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:36,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:36,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:36,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:36,047 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-22 12:25:36,048 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-22 12:25:36,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:36,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:36,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:36,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:36,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:36,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:36,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:36,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:36,085 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-22 12:25:36,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:36,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:36,087 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-22 12:25:36,089 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-22 12:25:36,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:36,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:36,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:36,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:36,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:36,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:36,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:36,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:36,124 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-22 12:25:36,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:36,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:36,126 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-22 12:25:36,127 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-22 12:25:36,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:36,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:36,136 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-22 12:25:36,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:36,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:36,141 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-22 12:25:36,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:36,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:36,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 12:25:36,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:36,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:36,177 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-22 12:25:36,178 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-22 12:25:36,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:36,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:36,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:36,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:36,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:36,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:36,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:36,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:36,250 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-22 12:25:36,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:36,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:36,251 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-22 12:25:36,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:36,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:36,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:36,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:36,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:36,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:36,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:36,270 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-22 12:25:36,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:36,318 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-22 12:25:36,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:36,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:36,319 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-22 12:25:36,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:36,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:36,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:36,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:36,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:36,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:36,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:36,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:36,334 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-22 12:25:36,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:36,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:36,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:36,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:36,384 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-22 12:25:36,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:36,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:36,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:36,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:36,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:36,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:36,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:36,401 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-22 12:25:36,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:36,431 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-22 12:25:36,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:36,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:36,432 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-22 12:25:36,434 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-22 12:25:36,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:36,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:36,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:36,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:36,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:36,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:36,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:36,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:36,471 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-22 12:25:36,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:36,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:36,472 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-22 12:25:36,476 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-22 12:25:36,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:36,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:36,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:36,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:36,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:36,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:36,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:36,489 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:36,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:36,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:36,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:36,512 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-22 12:25:36,513 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-22 12:25:36,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:36,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:36,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:36,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:36,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:36,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:36,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:36,541 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:25:36,586 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2022-07-22 12:25:36,586 INFO L444 ModelExtractionUtils]: 4 out of 28 variables were initially zero. Simplification set additionally 21 variables to zero. [2022-07-22 12:25:36,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:36,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:36,587 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-22 12:25:36,597 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:25:36,605 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-22 12:25:36,616 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:25:36,616 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:25:36,616 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1) = -1*ULTIMATE.start_create_fresh_uint_array_~i~3#1 + 1*ULTIMATE.start_create_fresh_uint_array_~size#1 Supporting invariants [] [2022-07-22 12:25:36,638 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-22 12:25:36,749 INFO L257 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2022-07-22 12:25:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:36,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:25:36,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:36,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:25:36,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:36,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:25:36,809 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:25:36,810 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 166 states and 558 transitions. cyclomatic complexity: 456 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:36,830 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 166 states and 558 transitions. cyclomatic complexity: 456. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 167 states and 560 transitions. Complement of second has 3 states. [2022-07-22 12:25:36,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:25:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2022-07-22 12:25:36,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:25:36,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:36,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:25:36,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:36,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-22 12:25:36,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:36,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 560 transitions. [2022-07-22 12:25:36,836 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2022-07-22 12:25:36,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 167 states and 560 transitions. [2022-07-22 12:25:36,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2022-07-22 12:25:36,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 165 [2022-07-22 12:25:36,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 560 transitions. [2022-07-22 12:25:36,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:36,840 INFO L220 hiAutomatonCegarLoop]: Abstraction has 167 states and 560 transitions. [2022-07-22 12:25:36,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 560 transitions. [2022-07-22 12:25:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-07-22 12:25:36,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 3.3532934131736525) internal successors, (560), 166 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:36,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 560 transitions. [2022-07-22 12:25:36,850 INFO L242 hiAutomatonCegarLoop]: Abstraction has 167 states and 560 transitions. [2022-07-22 12:25:36,850 INFO L425 stractBuchiCegarLoop]: Abstraction has 167 states and 560 transitions. [2022-07-22 12:25:36,851 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:25:36,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 560 transitions. [2022-07-22 12:25:36,853 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2022-07-22 12:25:36,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:36,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:36,854 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:25:36,854 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:36,855 INFO L748 eck$LassoCheckResult]: Stem: 2607#[ULTIMATE.startENTRY]don't care [676] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_1| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= v_~C~0.offset_Out_2 0) (= (select |v_#valid_In_3| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= v_~asum~0_Out_2 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6| 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_In_3| 1) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_10|) (= v_~p~0_Out_2 0) (= (select |v_#length_In_3| 2) 30) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_3| 1)) (= |v_#length_Out_6| (store (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| v_~N~0_Out_2) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~A~0.offset_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~C~0.base_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= v_~csum~0_Out_2 0))))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~C~0.base=v_~C~0.base_Out_2, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ~asum~0=v_~asum~0_Out_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ~C~0.offset=v_~C~0.offset_Out_2, ~p~0=v_~p~0_Out_2, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_Out_10|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_10|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, ~csum~0=v_~csum~0_Out_2, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~size#1, ~C~0.base, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_main_#t~pre14#1, ~asum~0, ULTIMATE.start_main_#t~nondet7#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~csum~0, ~C~0.offset, ~p~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2375#[L113-6]don't care [675] L113-6-->L113-14: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|)) (= (store |v_#valid_275| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 1) |v_#valid_274|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4)) |v_#length_221|) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 0)) (= v_~N~0_122 |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= v_~A~0.base_81 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= (select |v_#valid_275| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|) 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| |v_#StackHeapBarrier_53|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94| v_~A~0.offset_81)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_53|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|, #valid=|v_#valid_275|, #length=|v_#length_222|, ~N~0=v_~N~0_122, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94|} OutVars{~A~0.base=v_~A~0.base_81, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_59|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_57|, ~N~0=v_~N~0_122, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_37|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_57|, #StackHeapBarrier=|v_#StackHeapBarrier_53|, ~A~0.offset=v_~A~0.offset_81, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, #valid=|v_#valid_274|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_59|, #length=|v_#length_221|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ~A~0.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2307#[L113-14]don't care [649] L113-14-->L95-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= v_~C~0.offset_49 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= (store |v_#memory_int_170| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_170| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_169|) (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_171| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (= (select |v_#valid_212| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_47|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|) (= v_~C~0.base_49 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, #valid=|v_#valid_212|, #memory_int=|v_#memory_int_170|, #length=|v_#length_171|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ~C~0.base=v_~C~0.base_49, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_23|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_212|, #memory_int=|v_#memory_int_169|, ~C~0.offset=v_~C~0.offset_49, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|, #length=|v_#length_171|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ~C~0.base, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~C~0.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 2309#[L95-3]don't care [481] L95-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_8|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, 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~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 2605#[L95-4, thread1ENTRY]don't care [443] thread1ENTRY-->L50-5: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 2603#[L50-5, L95-4]don't care [2022-07-22 12:25:36,855 INFO L750 eck$LassoCheckResult]: Loop: 2603#[L50-5, L95-4]don't care [637] L50-5-->L50-5: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork0_~i~0_42 4))) (let ((.cse1 (+ v_~A~0.offset_51 .cse0))) (and (< v_thread1Thread1of1ForFork0_~i~0_42 v_~N~0_74) (= v_thread1Thread1of1ForFork0_~i~0_41 (+ v_thread1Thread1of1ForFork0_~i~0_42 1)) (<= (+ v_~A~0.offset_51 4 .cse0) (select |v_#length_147| v_~A~0.base_51)) (= (select |v_#valid_180| v_~A~0.base_51) 1) (<= 0 .cse1) (= (+ v_~asum~0_28 (select (select |v_#memory_int_151| v_~A~0.base_51) .cse1)) v_~asum~0_27)))) InVars {~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, ~asum~0=v_~asum~0_28, #valid=|v_#valid_180|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_42, #memory_int=|v_#memory_int_151|, #length=|v_#length_147|, ~N~0=v_~N~0_74} OutVars{~A~0.base=v_~A~0.base_51, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_27|, ~A~0.offset=v_~A~0.offset_51, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, ~asum~0=v_~asum~0_27, #valid=|v_#valid_180|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_41, #memory_int=|v_#memory_int_151|, #length=|v_#length_147|, ~N~0=v_~N~0_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~post1, ~asum~0, thread1Thread1of1ForFork0_~i~0] 2603#[L50-5, L95-4]don't care [2022-07-22 12:25:36,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:36,856 INFO L85 PathProgramCache]: Analyzing trace with hash 673677315, now seen corresponding path program 1 times [2022-07-22 12:25:36,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:36,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67376806] [2022-07-22 12:25:36,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:36,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:36,889 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:36,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:36,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:36,917 INFO L85 PathProgramCache]: Analyzing trace with hash 668, now seen corresponding path program 1 times [2022-07-22 12:25:36,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:36,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219773997] [2022-07-22 12:25:36,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:36,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:36,922 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:36,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:36,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:36,927 INFO L85 PathProgramCache]: Analyzing trace with hash -590839078, now seen corresponding path program 1 times [2022-07-22 12:25:36,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:36,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792702007] [2022-07-22 12:25:36,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:36,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:25:37,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:37,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792702007] [2022-07-22 12:25:37,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792702007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:25:37,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:25:37,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:25:37,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762670904] [2022-07-22 12:25:37,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:25:37,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:37,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:25:37,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:25:37,040 INFO L87 Difference]: Start difference. First operand 167 states and 560 transitions. cyclomatic complexity: 457 Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:37,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:37,178 INFO L93 Difference]: Finished difference Result 328 states and 1068 transitions. [2022-07-22 12:25:37,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 328 states and 1068 transitions. [2022-07-22 12:25:37,184 INFO L131 ngComponentsAnalysis]: Automaton has 110 accepting balls. 238 [2022-07-22 12:25:37,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 328 states to 324 states and 1056 transitions. [2022-07-22 12:25:37,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 322 [2022-07-22 12:25:37,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 322 [2022-07-22 12:25:37,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 324 states and 1056 transitions. [2022-07-22 12:25:37,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:37,192 INFO L220 hiAutomatonCegarLoop]: Abstraction has 324 states and 1056 transitions. [2022-07-22 12:25:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states and 1056 transitions. [2022-07-22 12:25:37,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 248. [2022-07-22 12:25:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 248 states have (on average 3.399193548387097) internal successors, (843), 247 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 843 transitions. [2022-07-22 12:25:37,214 INFO L242 hiAutomatonCegarLoop]: Abstraction has 248 states and 843 transitions. [2022-07-22 12:25:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:25:37,215 INFO L425 stractBuchiCegarLoop]: Abstraction has 248 states and 843 transitions. [2022-07-22 12:25:37,215 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:25:37,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 248 states and 843 transitions. [2022-07-22 12:25:37,219 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 182 [2022-07-22 12:25:37,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:37,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:37,220 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:37,220 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:37,222 INFO L748 eck$LassoCheckResult]: Stem: 3285#[ULTIMATE.startENTRY]don't care [676] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_1| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 1))) (and (= v_~C~0.offset_Out_2 0) (= (select |v_#valid_In_3| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= v_~asum~0_Out_2 0) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6| 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|) 0) (= 48 (select .cse0 0)) (= (select |v_#valid_In_3| 1) 1) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_10|) (= v_~p~0_Out_2 0) (= (select |v_#length_In_3| 2) 30) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_3| 1)) (= |v_#length_Out_6| (store (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2| 4))) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2| v_~N~0_Out_2) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~A~0.offset_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= v_~C~0.base_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= v_~csum~0_Out_2 0))))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~C~0.base=v_~C~0.base_Out_2, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ~asum~0=v_~asum~0_Out_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ~C~0.offset=v_~C~0.offset_Out_2, ~p~0=v_~p~0_Out_2, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_Out_6|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_Out_10|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_10|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, ~csum~0=v_~csum~0_Out_2, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~size#1, ~C~0.base, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_main_#t~pre14#1, ~asum~0, ULTIMATE.start_main_#t~nondet7#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~csum~0, ~C~0.offset, ~p~0, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3053#[L113-6]don't care [641] L113-6-->L113-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57| .cse0 4) (select |v_#length_155| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|)) (<= 0 .cse1) (= (select |v_#valid_188| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) 1) (= (store |v_#memory_int_154| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57| (store (select |v_#memory_int_154| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|) .cse1 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|)) |v_#memory_int_153|) (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_36|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_64|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_154|, #length=|v_#length_155|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_63|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_85|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_57|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_153|, #length=|v_#length_155|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_35|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_57|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 3055#[L113-6]don't care [675] L113-6-->L113-14: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|)) (= (store |v_#valid_275| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 1) |v_#valid_274|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4)) |v_#length_221|) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| 0)) (= v_~N~0_122 |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= v_~A~0.base_81 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|) (= (select |v_#valid_275| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|) 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93| |v_#StackHeapBarrier_53|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127| 4294967296) 1073741823) 1 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94| v_~A~0.offset_81)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_53|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_102|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_128|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_94|, #valid=|v_#valid_275|, #length=|v_#length_222|, ~N~0=v_~N~0_122, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_94|} OutVars{~A~0.base=v_~A~0.base_81, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_101|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_127|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_93|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_59|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_57|, ~N~0=v_~N~0_122, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_37|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_45|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_57|, #StackHeapBarrier=|v_#StackHeapBarrier_53|, ~A~0.offset=v_~A~0.offset_81, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, #valid=|v_#valid_274|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_79|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_59|, #length=|v_#length_221|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_93|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ~A~0.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3057#[L113-14]don't care [636] L113-14-->L113-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|) (= (store |v_#memory_int_140| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51| (store (select |v_#memory_int_140| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|)) |v_#memory_int_139|) (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|)) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|) (<= 0 .cse0) (= (select |v_#valid_174| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_32|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_56|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_140|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_55|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_51|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_139|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_33|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_51|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 2987#[L113-14]don't care [649] L113-14-->L95-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= v_~C~0.offset_49 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= (store |v_#memory_int_170| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_170| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_169|) (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_171| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (= (select |v_#valid_212| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_47|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|) (= v_~C~0.base_49 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, #valid=|v_#valid_212|, #memory_int=|v_#memory_int_170|, #length=|v_#length_171|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_71|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_93|, ~C~0.base=v_~C~0.base_49, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_35|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_23|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_23|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_212|, #memory_int=|v_#memory_int_169|, ~C~0.offset=v_~C~0.offset_49, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_35|, #length=|v_#length_171|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_63|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ~C~0.base, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~C~0.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 2989#[L95-3]don't care [481] L95-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_8|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, 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~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 3423#[L95-4, thread1ENTRY]don't care [443] thread1ENTRY-->L50-5: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 3425#[L50-5, L95-4]don't care [2022-07-22 12:25:37,222 INFO L750 eck$LassoCheckResult]: Loop: 3425#[L50-5, L95-4]don't care [637] L50-5-->L50-5: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork0_~i~0_42 4))) (let ((.cse1 (+ v_~A~0.offset_51 .cse0))) (and (< v_thread1Thread1of1ForFork0_~i~0_42 v_~N~0_74) (= v_thread1Thread1of1ForFork0_~i~0_41 (+ v_thread1Thread1of1ForFork0_~i~0_42 1)) (<= (+ v_~A~0.offset_51 4 .cse0) (select |v_#length_147| v_~A~0.base_51)) (= (select |v_#valid_180| v_~A~0.base_51) 1) (<= 0 .cse1) (= (+ v_~asum~0_28 (select (select |v_#memory_int_151| v_~A~0.base_51) .cse1)) v_~asum~0_27)))) InVars {~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, ~asum~0=v_~asum~0_28, #valid=|v_#valid_180|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_42, #memory_int=|v_#memory_int_151|, #length=|v_#length_147|, ~N~0=v_~N~0_74} OutVars{~A~0.base=v_~A~0.base_51, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_27|, ~A~0.offset=v_~A~0.offset_51, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, ~asum~0=v_~asum~0_27, #valid=|v_#valid_180|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_41, #memory_int=|v_#memory_int_151|, #length=|v_#length_147|, ~N~0=v_~N~0_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~post1, ~asum~0, thread1Thread1of1ForFork0_~i~0] 3425#[L50-5, L95-4]don't care [2022-07-22 12:25:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:37,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2080710644, now seen corresponding path program 1 times [2022-07-22 12:25:37,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:37,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413707618] [2022-07-22 12:25:37,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:37,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:37,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:37,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:37,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:37,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:37,426 INFO L85 PathProgramCache]: Analyzing trace with hash 668, now seen corresponding path program 2 times [2022-07-22 12:25:37,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:37,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638836128] [2022-07-22 12:25:37,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:37,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:37,431 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:37,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:37,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:37,436 INFO L85 PathProgramCache]: Analyzing trace with hash -77519887, now seen corresponding path program 1 times [2022-07-22 12:25:37,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:37,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152980310] [2022-07-22 12:25:37,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:37,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:37,487 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:37,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:39,605 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:39,605 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:39,605 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:39,605 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:39,605 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:39,606 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:39,606 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:39,606 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:39,606 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-simple-array-sum.wvr.c_BEv2_Iteration5_Lasso [2022-07-22 12:25:39,606 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:39,606 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:39,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:39,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:39,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:39,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:39,969 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:25:39,972 INFO L158 Benchmark]: Toolchain (without parser) took 20770.79ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 125.6MB in the beginning and 102.9MB in the end (delta: 22.8MB). Peak memory consumption was 107.0MB. Max. memory is 8.0GB. [2022-07-22 12:25:39,973 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 151.0MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:25:39,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.49ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 114.3MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:25:39,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.86ms. Allocated memory is still 151.0MB. Free memory was 114.3MB in the beginning and 112.4MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:25:39,974 INFO L158 Benchmark]: Boogie Preprocessor took 74.70ms. Allocated memory is still 151.0MB. Free memory was 112.4MB in the beginning and 110.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:25:39,974 INFO L158 Benchmark]: RCFGBuilder took 768.43ms. Allocated memory is still 151.0MB. Free memory was 110.8MB in the beginning and 127.7MB in the end (delta: -16.9MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2022-07-22 12:25:39,975 INFO L158 Benchmark]: BuchiAutomizer took 19323.51ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 127.7MB in the beginning and 102.9MB in the end (delta: 24.9MB). Peak memory consumption was 108.8MB. Max. memory is 8.0GB. [2022-07-22 12:25:39,977 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.28ms. Allocated memory is still 151.0MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 506.49ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 114.3MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 85.86ms. Allocated memory is still 151.0MB. Free memory was 114.3MB in the beginning and 112.4MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 74.70ms. Allocated memory is still 151.0MB. Free memory was 112.4MB in the beginning and 110.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 768.43ms. Allocated memory is still 151.0MB. Free memory was 110.8MB in the beginning and 127.7MB in the end (delta: -16.9MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 19323.51ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 127.7MB in the beginning and 102.9MB in the end (delta: 24.9MB). Peak memory consumption was 108.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 175 PlacesBefore, 33 PlacesAfterwards, 181 TransitionsBefore, 29 TransitionsAfterwards, 1720 CoEnabledTransitionPairs, 7 FixpointIterations, 111 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 27 TrivialYvCompositions, 6 ConcurrentYvCompositions, 10 ChoiceCompositions, 186 TotalNumberOfCompositions, 2482 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2059, positive: 1997, positive conditional: 0, positive unconditional: 1997, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1168, positive: 1145, positive conditional: 0, positive unconditional: 1145, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1168, positive: 1145, positive conditional: 0, positive unconditional: 1145, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 100, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2059, positive: 852, positive conditional: 0, positive unconditional: 852, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 1168, unknown conditional: 0, unknown unconditional: 1168] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:25:39,995 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...