/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 11:54:18,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:54:18,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:54:18,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:54:18,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:54:18,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:54:18,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:54:18,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:54:18,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:54:18,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:54:18,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:54:18,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:54:18,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:54:18,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:54:18,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:54:18,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:54:18,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:54:18,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:54:18,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:54:18,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:54:18,986 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:54:18,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:54:18,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:54:18,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:54:18,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:54:19,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:54:19,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:54:19,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:54:19,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:54:19,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:54:19,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:54:19,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:54:19,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:54:19,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:54:19,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:54:19,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:54:19,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:54:19,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:54:19,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:54:19,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:54:19,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:54:19,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:54:19,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2022-07-22 11:54:19,080 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:54:19,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:54:19,082 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:54:19,082 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:54:19,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:54:19,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:54:19,084 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:54:19,085 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 11:54:19,085 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 11:54:19,086 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 11:54:19,087 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 11:54:19,087 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 11:54:19,087 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 11:54:19,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:54:19,087 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:54:19,088 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 11:54:19,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:54:19,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:54:19,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:54:19,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 11:54:19,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 11:54:19,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 11:54:19,089 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:54:19,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:54:19,090 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 11:54:19,090 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:54:19,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 11:54:19,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:54:19,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:54:19,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:54:19,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:54:19,092 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:54:19,094 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 11:54:19,095 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-22 11:54:19,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:54:19,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:54:19,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:54:19,599 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:54:19,600 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:54:19,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2022-07-22 11:54:19,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b97b498d3/90f5fe02552b463a87ced4522d756263/FLAGc782e1758 [2022-07-22 11:54:20,480 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:54:20,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2022-07-22 11:54:20,492 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b97b498d3/90f5fe02552b463a87ced4522d756263/FLAGc782e1758 [2022-07-22 11:54:20,831 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b97b498d3/90f5fe02552b463a87ced4522d756263 [2022-07-22 11:54:20,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:54:20,840 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 11:54:20,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:54:20,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:54:20,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:54:20,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:54:20" (1/1) ... [2022-07-22 11:54:20,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d02a6cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:20, skipping insertion in model container [2022-07-22 11:54:20,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:54:20" (1/1) ... [2022-07-22 11:54:20,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:54:20,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:54:21,135 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-bad-dot-product-alt.wvr.c[3182,3195] [2022-07-22 11:54:21,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:54:21,156 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:54:21,202 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-bad-dot-product-alt.wvr.c[3182,3195] [2022-07-22 11:54:21,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:54:21,243 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:54:21,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:21 WrapperNode [2022-07-22 11:54:21,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:54:21,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:54:21,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:54:21,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:54:21,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:21" (1/1) ... [2022-07-22 11:54:21,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:21" (1/1) ... [2022-07-22 11:54:21,346 INFO L137 Inliner]: procedures = 28, calls = 74, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 352 [2022-07-22 11:54:21,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:54:21,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:54:21,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:54:21,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:54:21,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:21" (1/1) ... [2022-07-22 11:54:21,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:21" (1/1) ... [2022-07-22 11:54:21,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:21" (1/1) ... [2022-07-22 11:54:21,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:21" (1/1) ... [2022-07-22 11:54:21,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:21" (1/1) ... [2022-07-22 11:54:21,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:21" (1/1) ... [2022-07-22 11:54:21,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:21" (1/1) ... [2022-07-22 11:54:21,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:54:21,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:54:21,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:54:21,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:54:21,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:21" (1/1) ... [2022-07-22 11:54:21,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:21,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:21,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:54:21,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 11:54:21,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:54:21,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 11:54:21,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 11:54:21,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 11:54:21,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 11:54:21,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 11:54:21,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 11:54:21,547 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 11:54:21,547 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 11:54:21,548 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 11:54:21,548 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 11:54:21,548 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 11:54:21,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:54:21,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 11:54:21,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 11:54:21,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:54:21,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:54:21,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:54:21,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 11:54:21,552 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 11:54:21,766 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:54:21,769 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:54:22,507 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:54:22,781 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:54:22,781 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-07-22 11:54:22,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:54:22 BoogieIcfgContainer [2022-07-22 11:54:22,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:54:22,787 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 11:54:22,787 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 11:54:22,793 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 11:54:22,794 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:54:22,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 11:54:20" (1/3) ... [2022-07-22 11:54:22,796 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73c118cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:54:22, skipping insertion in model container [2022-07-22 11:54:22,796 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:54:22,796 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:21" (2/3) ... [2022-07-22 11:54:22,796 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73c118cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:54:22, skipping insertion in model container [2022-07-22 11:54:22,797 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:54:22,797 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:54:22" (3/3) ... [2022-07-22 11:54:22,799 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2022-07-22 11:54:23,035 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 11:54:23,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 319 places, 347 transitions, 718 flow [2022-07-22 11:54:23,305 INFO L129 PetriNetUnfolder]: 35/341 cut-off events. [2022-07-22 11:54:23,306 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 11:54:23,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 341 events. 35/341 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 656 event pairs, 0 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 273. Up to 2 conditions per place. [2022-07-22 11:54:23,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 319 places, 347 transitions, 718 flow [2022-07-22 11:54:23,343 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 316 places, 341 transitions, 700 flow [2022-07-22 11:54:23,360 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 11:54:23,360 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 11:54:23,361 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 11:54:23,361 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 11:54:23,361 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 11:54:23,362 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 11:54:23,362 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 11:54:23,362 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 11:54:23,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 11:54:42,503 INFO L131 ngComponentsAnalysis]: Automaton has 337 accepting balls. 198226 [2022-07-22 11:54:42,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:54:42,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:54:42,515 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:54:42,516 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 11:54:42,516 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 11:54:42,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 198791 states, but on-demand construction may add more states [2022-07-22 11:54:47,942 INFO L131 ngComponentsAnalysis]: Automaton has 337 accepting balls. 198226 [2022-07-22 11:54:47,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:54:47,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:54:47,945 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:54:47,945 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 11:54:47,953 INFO L748 eck$LassoCheckResult]: Stem: 322#[ULTIMATE.startENTRY]don't care [1041] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 325#[L-1]don't care [937] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 327#[L-1-1]don't care [1051] L-1-1-->L-1-2: Formula: (= (select |v_#valid_41| 0) 0) InVars {#valid=|v_#valid_41|} OutVars{#valid=|v_#valid_41|} AuxVars[] AssignedVars[] 329#[L-1-2]don't care [1053] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 331#[L21]don't care [844] L21-->L21-1: Formula: (and (= (select |v_#valid_42| 1) 1) (= 2 (select |v_#length_35| 1))) InVars {#length=|v_#length_35|, #valid=|v_#valid_42|} OutVars{#length=|v_#length_35|, #valid=|v_#valid_42|} AuxVars[] AssignedVars[] 333#[L21-1]don't care [1039] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_35| 1) 0)) InVars {#memory_int=|v_#memory_int_35|} OutVars{#memory_int=|v_#memory_int_35|} AuxVars[] AssignedVars[] 335#[L21-2]don't care [946] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_36| 1) 1) 0) InVars {#memory_int=|v_#memory_int_36|} OutVars{#memory_int=|v_#memory_int_36|} AuxVars[] AssignedVars[] 337#[L21-3]don't care [993] L21-3-->L21-4: Formula: (and (= 33 (select |v_#length_36| 2)) (= (select |v_#valid_43| 2) 1)) InVars {#length=|v_#length_36|, #valid=|v_#valid_43|} OutVars{#length=|v_#length_36|, #valid=|v_#valid_43|} AuxVars[] AssignedVars[] 339#[L21-4]don't care [805] L21-4-->L42: Formula: (and (= v_~A~0.base_10 0) (= v_~A~0.offset_10 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_10, ~A~0.offset=v_~A~0.offset_10} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 341#[L42]don't care [791] L42-->L43: Formula: (and (= v_~B~0.offset_10 0) (= v_~B~0.base_10 0)) InVars {} OutVars{~B~0.offset=v_~B~0.offset_10, ~B~0.base=v_~B~0.base_10} AuxVars[] AssignedVars[~B~0.base, ~B~0.offset] 343#[L43]don't care [1044] L43-->L44: Formula: (and (= v_~mult~0.offset_5 0) (= v_~mult~0.base_5 0)) InVars {} OutVars{~mult~0.base=v_~mult~0.base_5, ~mult~0.offset=v_~mult~0.offset_5} AuxVars[] AssignedVars[~mult~0.base, ~mult~0.offset] 345#[L44]don't care [760] L44-->L44-1: Formula: (= v_~M~0_5 0) InVars {} OutVars{~M~0=v_~M~0_5} AuxVars[] AssignedVars[~M~0] 347#[L44-1]don't care [822] L44-1-->L44-2: Formula: (= v_~N~0_6 0) InVars {} OutVars{~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 349#[L44-2]don't care [991] L44-2-->L44-3: Formula: (= v_~maxA~0_4 0) InVars {} OutVars{~maxA~0=v_~maxA~0_4} AuxVars[] AssignedVars[~maxA~0] 351#[L44-3]don't care [740] L44-3-->L44-4: Formula: (= v_~maxB~0_4 0) InVars {} OutVars{~maxB~0=v_~maxB~0_4} AuxVars[] AssignedVars[~maxB~0] 353#[L44-4]don't care [726] L44-4-->L44-5: Formula: (= v_~res1~0_4 0) InVars {} OutVars{~res1~0=v_~res1~0_4} AuxVars[] AssignedVars[~res1~0] 355#[L44-5]don't care [1025] L44-5-->L-1-3: Formula: (= v_~res2~0_6 0) InVars {} OutVars{~res2~0=v_~res2~0_6} AuxVars[] AssignedVars[~res2~0] 357#[L-1-3]don't care [1057] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 359#[L-1-4]don't care [777] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 361#[L-1-5]don't care [904] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 363#[L-1-6]don't care [1030] L-1-6-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_3|, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_4|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_4|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_1|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_1|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_3|, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_1|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_2|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_1|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_1|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_4|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_4|, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_3|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_2|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_4|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem56#1, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_main_#t~ret43#1.base, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~nondet52#1, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~i~3#1] 365#[L83]don't care [744] L83-->L83-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_44|) (= |v_#length_37| (store |v_#length_38| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_38|, #valid=|v_#valid_45|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_37|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_44|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 367#[L83-1]don't care [810] L83-1-->L83-2: Formula: (and (= (store |v_#length_40| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_39|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_46|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_40|, #valid=|v_#valid_47|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_39|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_46|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 369#[L83-2]don't care [862] L83-2-->L83-3: Formula: (and (= (store |v_#length_42| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 4) |v_#length_41|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_6| 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_6| 0)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 1) |v_#valid_48|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_42|, #valid=|v_#valid_49|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_41|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, #valid=|v_#valid_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 371#[L83-3]don't care [867] L83-3-->L86: Formula: (= |v_ULTIMATE.start_main_#t~nondet40#1_2| v_~M~0_6) InVars {ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_2|} OutVars{~M~0=v_~M~0_6, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_2|} AuxVars[] AssignedVars[~M~0] 373#[L86]don't care [892] L86-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40#1] 375#[L87]don't care [790] L87-->L87-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet41#1_2| v_~N~0_7) InVars {ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_2|} OutVars{ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_2|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0] 377#[L87-1]don't care [898] L87-1-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41#1] 379#[L88]don't care [838] L88-->L88-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 381#[L88-1]don't care [864] L88-1-->L88-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_8) InVars {~N~0=v_~N~0_8} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 383#[L88-2]don't care [734] L88-2-->L88-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 385#[L88-3]don't care [977] L88-3-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 387#[L115]don't care [794] L115-->L116: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 389#[L116]don't care [926] L116-->L116-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 391#[L116-1]don't care [1013] L116-1-->L116-2: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 393#[L116-2]don't care [1033] L116-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 395#[L37]don't care [795] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 397#[L38]don't care [968] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_16| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[] 401#[L37-1]don't care [958] L37-1-->L117: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 403#[L117]don't care [727] L117-->L117-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 405#[L117-1]don't care [842] L117-1-->L117-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_8| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 407#[L117-2]don't care [743] L117-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 409#[L37-2]don't care [908] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_18| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 411#[L38-3]don't care [762] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_20| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} AuxVars[] AssignedVars[] 415#[L37-3]don't care [748] L37-3-->L119: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 417#[L119]don't care [1042] L119-->L119-1: Formula: (and (= |v_#length_43| (store |v_#length_44| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_5| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_9| 4))) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_5| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_5| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_5| 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_5| |v_#StackHeapBarrier_6|) (= (select |v_#valid_51| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_5|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_6|, #length=|v_#length_44|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_9|, #valid=|v_#valid_51|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_6|, #valid=|v_#valid_50|, #length=|v_#length_43|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset] 419#[L119-1]don't care [923] L119-1-->L119-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_6|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_6|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 421#[L119-2]don't care [939] L119-2-->L120: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_7|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset] 423#[L120]don't care [945] L120-->L120-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_8| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1] 425#[L120-6]don't care [2022-07-22 11:54:47,955 INFO L750 eck$LassoCheckResult]: Loop: 425#[L120-6]don't care [997] L120-6-->L121: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_10| |v_ULTIMATE.start_create_fresh_int_array_~size#1_11|) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_11|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_11|} AuxVars[] AssignedVars[] 429#[L121]don't care [746] L121-->L121-1: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_11| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_6| .cse1))) (and (= (store |v_#memory_$Pointer$.base_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_6| (store (select |v_#memory_$Pointer$.base_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_6|) .cse0 (select (select |v_#memory_$Pointer$.base_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_6|) .cse0))) |v_#memory_$Pointer$.base_14|) (= |v_#memory_int_37| (store |v_#memory_int_38| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_6| (store (select |v_#memory_int_38| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_6|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_4|))) (= (select |v_#valid_52| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_6|) 1) (<= 0 .cse0) (= |v_#memory_$Pointer$.offset_14| (store |v_#memory_$Pointer$.offset_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_6| (store (select |v_#memory_$Pointer$.offset_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_6|) .cse0 (select (select |v_#memory_$Pointer$.offset_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_6|) .cse0)))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_6| .cse1 4) (select |v_#length_45| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_6|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_6|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_11|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_4|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_15|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_6|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_38|, #length=|v_#length_45|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_15|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_6|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_11|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_4|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_14|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_6|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_37|, #length=|v_#length_45|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_14|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 433#[L121-1]don't care [849] L121-1-->L120-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet60#1] 437#[L120-3]don't care [992] L120-3-->L120-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_12| |v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_12|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_12|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post59#1] 441#[L120-4]don't care [747] L120-4-->L120-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_13| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_6| 1)) InVars {ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_13|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1] 445#[L120-5]don't care [749] L120-5-->L120-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post59#1] 425#[L120-6]don't care [2022-07-22 11:54:47,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:54:47,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1219020141, now seen corresponding path program 1 times [2022-07-22 11:54:47,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:54:47,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511335181] [2022-07-22 11:54:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:54:47,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:54:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:48,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:54:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:48,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:54:48,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:54:48,296 INFO L85 PathProgramCache]: Analyzing trace with hash 81212599, now seen corresponding path program 1 times [2022-07-22 11:54:48,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:54:48,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875410601] [2022-07-22 11:54:48,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:54:48,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:54:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:48,337 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:54:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:48,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:54:48,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:54:48,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1405535965, now seen corresponding path program 1 times [2022-07-22 11:54:48,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:54:48,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937548858] [2022-07-22 11:54:48,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:54:48,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:54:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:48,460 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:54:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:48,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:54:50,466 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:54:50,467 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:54:50,467 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:54:50,467 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:54:50,467 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:54:50,467 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:50,468 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:54:50,468 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:54:50,468 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-dot-product-alt.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 11:54:50,468 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:54:50,468 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:54:50,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:50,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:51,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:52,173 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:54:52,179 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 11:54:52,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:52,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:52,184 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:54:52,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:52,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 11:54:52,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:52,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:52,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:52,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:52,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:52,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:52,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:52,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:52,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 11:54:52,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:52,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:52,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 11:54:52,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:52,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:52,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:52,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:52,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:52,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:52,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:52,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:52,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 11:54:52,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:52,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-22 11:54:52,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:52,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:52,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:54:52,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 11:54:52,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:52,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:52,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:52,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:52,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:52,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:52,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:52,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:52,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:52,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:52,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:52,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:52,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:54:52,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:52,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:52,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:52,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:52,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:52,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:52,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:52,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:52,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 11:54:52,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:52,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:52,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:52,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:52,497 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:54:52,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:52,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:52,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:52,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:52,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:52,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:52,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:52,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:52,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 11:54:52,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:52,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:52,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:52,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:52,574 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:54:52,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 11:54:52,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:52,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:52,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:52,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:52,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:52,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:52,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:52,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:52,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:52,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:52,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:52,638 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:54:52,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:52,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 11:54:52,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:52,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:52,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:52,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:52,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:52,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:52,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:52,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:52,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:52,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:52,710 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:54:52,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 11:54:52,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:52,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:52,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:52,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:52,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:52,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:52,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:52,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:52,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:52,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:52,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:52,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:52,770 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:54:52,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 11:54:52,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:52,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:52,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:52,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:52,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:52,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:52,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:52,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:52,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:52,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:52,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:52,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:52,826 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:54:52,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 11:54:52,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:52,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:52,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:52,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:52,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:52,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:52,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:52,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:52,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:52,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:52,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:52,905 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 11:54:52,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:52,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:52,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:52,921 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 11:54:52,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:52,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:52,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:52,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:52,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:52,975 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 11:54:52,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:52,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:52,977 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 11:54:52,981 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 11:54:52,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:52,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:52,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:52,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:52,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:52,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:52,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:52,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:53,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,037 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 11:54:53,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,039 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 11:54:53,040 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 11:54:53,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:53,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:53,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:53,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:53,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:53,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:53,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:53,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:53,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:53,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,079 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 11:54:53,080 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 11:54:53,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:53,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:53,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:53,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:53,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:53,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:53,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:53,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:53,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,114 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 11:54:53,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,116 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 11:54:53,119 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 11:54:53,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:53,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:53,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:53,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:53,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:53,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:53,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:53,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:53,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-22 11:54:53,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,157 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 11:54:53,158 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 11:54:53,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:53,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:53,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:53,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:53,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:53,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:53,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:53,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,236 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 11:54:53,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,238 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 11:54:53,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:53,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:53,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:53,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:53,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:53,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:53,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:53,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:53,263 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 11:54:53,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,314 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 11:54:53,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,316 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 11:54:53,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:53,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:53,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:53,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:53,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:53,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:53,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:53,339 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 11:54:53,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,387 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 11:54:53,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,390 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 11:54:53,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:53,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:53,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:53,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:53,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:53,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:53,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:53,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:53,412 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 11:54:53,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:53,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,457 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 11:54:53,461 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 11:54:53,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:53,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:53,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:53,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:53,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:53,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:53,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:53,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,527 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 11:54:53,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,529 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 11:54:53,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:53,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:53,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:53,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:53,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:53,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:53,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:53,554 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 11:54:53,561 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:53,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,602 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 11:54:53,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:53,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:53,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:53,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:53,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:53,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:53,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:53,622 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 11:54:53,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:53,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,670 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 11:54:53,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:53,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:53,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:53,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:53,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:53,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:53,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:53,691 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 11:54:53,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:53,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,741 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 11:54:53,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:53,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:53,752 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 11:54:53,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:53,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:53,757 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 11:54:53,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:53,766 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 11:54:53,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,812 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 11:54:53,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,814 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 11:54:53,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:53,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:53,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:53,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:53,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:53,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:53,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:53,838 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 11:54:53,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,884 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 11:54:53,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,886 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 11:54:53,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:53,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:53,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:53,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:53,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:53,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:53,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:53,905 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 11:54:53,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,943 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 11:54:53,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,945 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 11:54:53,949 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 11:54:53,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:53,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:53,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:53,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:53,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:53,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:53,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:53,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:53,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:53,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:53,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:53,992 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 11:54:53,995 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 11:54:53,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:54,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:54,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:54,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:54,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:54,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:54,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:54,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:54,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:54,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:54,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:54,064 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 11:54:54,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:54,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:54,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:54,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:54,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:54,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:54,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:54,092 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 11:54:54,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:54,138 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 11:54:54,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:54,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:54,140 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 11:54:54,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:54,142 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 11:54:54,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:54,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:54,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:54,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:54,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:54,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:54,174 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 11:54:54,200 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-22 11:54:54,201 INFO L444 ModelExtractionUtils]: 12 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-07-22 11:54:54,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:54,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:54,206 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 11:54:54,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 11:54:54,222 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 11:54:54,246 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 11:54:54,247 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 11:54:54,248 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~4#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 11:54:54,288 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 11:54:54,442 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 11:54:54,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:54:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:54:54,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:54:54,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:54:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:54:54,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:54:54,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:54:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:54:54,700 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:54:54,704 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 198791 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:54:55,768 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 11:55:03,659 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 198791 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 397558 states and 1633421 transitions. Complement of second has 8 states. [2022-07-22 11:55:03,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 11:55:03,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:55:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 360 transitions. [2022-07-22 11:55:03,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 360 transitions. Stem has 49 letters. Loop has 6 letters. [2022-07-22 11:55:03,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:55:03,673 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 11:55:03,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:55:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:55:03,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:55:03,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:55:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:55:03,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:55:03,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:55:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:55:03,834 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:55:03,835 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 198791 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:55:12,816 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 198791 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 397552 states and 1633414 transitions. Complement of second has 10 states. [2022-07-22 11:55:12,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 11:55:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:55:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 361 transitions. [2022-07-22 11:55:12,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 361 transitions. Stem has 49 letters. Loop has 6 letters. [2022-07-22 11:55:12,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:55:12,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 361 transitions. Stem has 55 letters. Loop has 6 letters. [2022-07-22 11:55:12,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:55:12,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 361 transitions. Stem has 49 letters. Loop has 12 letters. [2022-07-22 11:55:12,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:55:12,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 397552 states and 1633414 transitions. [2022-07-22 11:55:28,314 INFO L131 ngComponentsAnalysis]: Automaton has 336 accepting balls. 198220 [2022-07-22 11:55:36,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 397552 states to 198627 states and 816065 transitions. [2022-07-22 11:55:36,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198620 [2022-07-22 11:55:37,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198621 [2022-07-22 11:55:37,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198627 states and 816065 transitions. [2022-07-22 11:55:39,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 11:55:39,579 INFO L220 hiAutomatonCegarLoop]: Abstraction has 198627 states and 816065 transitions. [2022-07-22 11:55:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198627 states and 816065 transitions. [2022-07-22 11:55:53,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198627 to 198627. [2022-07-22 11:55:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198627 states, 198627 states have (on average 4.108530058854033) internal successors, (816065), 198626 states have internal predecessors, (816065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:55:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198627 states to 198627 states and 816065 transitions. [2022-07-22 11:55:59,805 INFO L242 hiAutomatonCegarLoop]: Abstraction has 198627 states and 816065 transitions. [2022-07-22 11:55:59,805 INFO L425 stractBuchiCegarLoop]: Abstraction has 198627 states and 816065 transitions. [2022-07-22 11:55:59,805 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 11:55:59,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198627 states and 816065 transitions. [2022-07-22 11:56:03,996 INFO L131 ngComponentsAnalysis]: Automaton has 336 accepting balls. 198220 [2022-07-22 11:56:03,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:56:03,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:56:04,005 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:56:04,005 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 11:56:04,024 INFO L748 eck$LassoCheckResult]: Stem: 1472352#[ULTIMATE.startENTRY]don't care [1041] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1472354#[L-1]don't care [937] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 1537648#[L-1-1]don't care [1051] L-1-1-->L-1-2: Formula: (= (select |v_#valid_41| 0) 0) InVars {#valid=|v_#valid_41|} OutVars{#valid=|v_#valid_41|} AuxVars[] AssignedVars[] 1578838#[L-1-2]don't care [1053] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 1590262#[L21]don't care [844] L21-->L21-1: Formula: (and (= (select |v_#valid_42| 1) 1) (= 2 (select |v_#length_35| 1))) InVars {#length=|v_#length_35|, #valid=|v_#valid_42|} OutVars{#length=|v_#length_35|, #valid=|v_#valid_42|} AuxVars[] AssignedVars[] 1590102#[L21-1]don't care [1039] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_35| 1) 0)) InVars {#memory_int=|v_#memory_int_35|} OutVars{#memory_int=|v_#memory_int_35|} AuxVars[] AssignedVars[] 1590104#[L21-2]don't care [946] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_36| 1) 1) 0) InVars {#memory_int=|v_#memory_int_36|} OutVars{#memory_int=|v_#memory_int_36|} AuxVars[] AssignedVars[] 1243018#[L21-3]don't care [993] L21-3-->L21-4: Formula: (and (= 33 (select |v_#length_36| 2)) (= (select |v_#valid_43| 2) 1)) InVars {#length=|v_#length_36|, #valid=|v_#valid_43|} OutVars{#length=|v_#length_36|, #valid=|v_#valid_43|} AuxVars[] AssignedVars[] 1243020#[L21-4]don't care [805] L21-4-->L42: Formula: (and (= v_~A~0.base_10 0) (= v_~A~0.offset_10 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_10, ~A~0.offset=v_~A~0.offset_10} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 1313406#[L42]don't care [791] L42-->L43: Formula: (and (= v_~B~0.offset_10 0) (= v_~B~0.base_10 0)) InVars {} OutVars{~B~0.offset=v_~B~0.offset_10, ~B~0.base=v_~B~0.base_10} AuxVars[] AssignedVars[~B~0.base, ~B~0.offset] 1425656#[L43]don't care [1044] L43-->L44: Formula: (and (= v_~mult~0.offset_5 0) (= v_~mult~0.base_5 0)) InVars {} OutVars{~mult~0.base=v_~mult~0.base_5, ~mult~0.offset=v_~mult~0.offset_5} AuxVars[] AssignedVars[~mult~0.base, ~mult~0.offset] 1425658#[L44]don't care [760] L44-->L44-1: Formula: (= v_~M~0_5 0) InVars {} OutVars{~M~0=v_~M~0_5} AuxVars[] AssignedVars[~M~0] 1577668#[L44-1]don't care [822] L44-1-->L44-2: Formula: (= v_~N~0_6 0) InVars {} OutVars{~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 1486820#[L44-2]don't care [991] L44-2-->L44-3: Formula: (= v_~maxA~0_4 0) InVars {} OutVars{~maxA~0=v_~maxA~0_4} AuxVars[] AssignedVars[~maxA~0] 1486822#[L44-3]don't care [740] L44-3-->L44-4: Formula: (= v_~maxB~0_4 0) InVars {} OutVars{~maxB~0=v_~maxB~0_4} AuxVars[] AssignedVars[~maxB~0] 1557680#[L44-4]don't care [726] L44-4-->L44-5: Formula: (= v_~res1~0_4 0) InVars {} OutVars{~res1~0=v_~res1~0_4} AuxVars[] AssignedVars[~res1~0] 1557682#[L44-5]don't care [1025] L44-5-->L-1-3: Formula: (= v_~res2~0_6 0) InVars {} OutVars{~res2~0=v_~res2~0_6} AuxVars[] AssignedVars[~res2~0] 1561864#[L-1-3]don't care [1057] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1575460#[L-1-4]don't care [777] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1405074#[L-1-5]don't care [904] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 1210686#[L-1-6]don't care [1030] L-1-6-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem56#1=|v_ULTIMATE.start_main_#t~mem56#1_3|, ULTIMATE.start_main_#t~pre51#1=|v_ULTIMATE.start_main_#t~pre51#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, ULTIMATE.start_main_#t~ret48#1.offset=|v_ULTIMATE.start_main_#t~ret48#1.offset_4|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~post47#1=|v_ULTIMATE.start_main_#t~post47#1_4|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_1|, ULTIMATE.start_main_#t~ret43#1.base=|v_ULTIMATE.start_main_#t~ret43#1.base_1|, ULTIMATE.start_main_#t~mem57#1=|v_ULTIMATE.start_main_#t~mem57#1_3|, ULTIMATE.start_main_#t~malloc46#1.offset=|v_ULTIMATE.start_main_#t~malloc46#1.offset_1|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_2|, ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_1|, ULTIMATE.start_main_#t~ret43#1.offset=|v_ULTIMATE.start_main_#t~ret43#1.offset_1|, ULTIMATE.start_main_#t~ret48#1.base=|v_ULTIMATE.start_main_#t~ret48#1.base_4|, ULTIMATE.start_main_#t~nondet45#1=|v_ULTIMATE.start_main_#t~nondet45#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~malloc46#1.base=|v_ULTIMATE.start_main_#t~malloc46#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_4|, ULTIMATE.start_main_#t~mem55#1=|v_ULTIMATE.start_main_#t~mem55#1_3|, ULTIMATE.start_main_#t~nondet50#1=|v_ULTIMATE.start_main_#t~nondet50#1_2|, ULTIMATE.start_main_#t~pre53#1=|v_ULTIMATE.start_main_#t~pre53#1_4|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem56#1, ULTIMATE.start_main_#t~pre51#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret48#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~post47#1, ULTIMATE.start_main_#t~ret42#1.offset, ULTIMATE.start_main_#t~ret43#1.base, ULTIMATE.start_main_#t~mem57#1, ULTIMATE.start_main_#t~malloc46#1.offset, ULTIMATE.start_main_#t~nondet52#1, ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret43#1.offset, ULTIMATE.start_main_#t~ret48#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~malloc46#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~pre49#1, ULTIMATE.start_main_#t~mem55#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_#t~pre53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~i~3#1] 1210688#[L83]don't care [744] L83-->L83-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_44|) (= |v_#length_37| (store |v_#length_38| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_38|, #valid=|v_#valid_45|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_37|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_44|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 1241766#[L83-1]don't care [810] L83-1-->L83-2: Formula: (and (= (store |v_#length_40| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_39|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_46|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_40|, #valid=|v_#valid_47|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_39|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_46|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 1589442#[L83-2]don't care [862] L83-2-->L83-3: Formula: (and (= (store |v_#length_42| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 4) |v_#length_41|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_6| 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_6| 0)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 1) |v_#valid_48|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_42|, #valid=|v_#valid_49|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_41|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, #valid=|v_#valid_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 1577932#[L83-3]don't care [867] L83-3-->L86: Formula: (= |v_ULTIMATE.start_main_#t~nondet40#1_2| v_~M~0_6) InVars {ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_2|} OutVars{~M~0=v_~M~0_6, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_2|} AuxVars[] AssignedVars[~M~0] 1577934#[L86]don't care [892] L86-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40#1] 1590644#[L87]don't care [790] L87-->L87-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet41#1_2| v_~N~0_7) InVars {ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_2|} OutVars{ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_2|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0] 1485144#[L87-1]don't care [898] L87-1-->L88: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41#1] 1485146#[L88]don't care [838] L88-->L88-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1589260#[L88-1]don't care [864] L88-1-->L88-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_8) InVars {~N~0=v_~N~0_8} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 1579902#[L88-2]don't care [734] L88-2-->L88-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1545816#[L88-3]don't care [977] L88-3-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 1545818#[L115]don't care [794] L115-->L116: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 1576144#[L116]don't care [926] L116-->L116-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1576146#[L116-1]don't care [1013] L116-1-->L116-2: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1561670#[L116-2]don't care [1033] L116-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1561672#[L37]don't care [795] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1590696#[L38]don't care [968] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_16| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[] 1588706#[L37-1]don't care [958] L37-1-->L117: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1588708#[L117]don't care [727] L117-->L117-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1515986#[L117-1]don't care [842] L117-1-->L117-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_8| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1515988#[L117-2]don't care [743] L117-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1590684#[L37-2]don't care [908] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_18| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1529156#[L38-3]don't care [762] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_20| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} AuxVars[] AssignedVars[] 1529158#[L37-3]don't care [748] L37-3-->L119: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1564792#[L119]don't care [1042] L119-->L119-1: Formula: (and (= |v_#length_43| (store |v_#length_44| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_5| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_9| 4))) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_5| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_5| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_5| 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_5| |v_#StackHeapBarrier_6|) (= (select |v_#valid_51| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_5|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_6|, #length=|v_#length_44|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_9|, #valid=|v_#valid_51|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_6|, #valid=|v_#valid_50|, #length=|v_#length_43|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset] 1589686#[L119-1]don't care [923] L119-1-->L119-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_6|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_6|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 1586294#[L119-2]don't care [939] L119-2-->L120: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_7|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset] 1586296#[L120]don't care [945] L120-->L120-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_8| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1] 1579106#[L120-6]don't care [996] L120-6-->L120-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_9| |v_ULTIMATE.start_create_fresh_int_array_~size#1_10|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_10|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_10|} AuxVars[] AssignedVars[] 1474370#[L120-7]don't care [900] L120-7-->L123: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_7| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_4|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_7| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_4|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_7|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_7|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1449822#[L123]don't care [916] L123-->L88-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret42#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_5|) (= |v_ULTIMATE.start_main_#t~ret42#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_5|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_5|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_5|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_5|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret42#1.offset] 1449824#[L88-4]don't care [1060] L88-4-->L88-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1502590#[L88-5]don't care [1023] L88-5-->L88-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret42#1.base_3| v_~A~0.base_11) (= |v_ULTIMATE.start_main_#t~ret42#1.offset_3| v_~A~0.offset_11)) InVars {ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_3|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_3|} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_3|, ~A~0.base=v_~A~0.base_11, ~A~0.offset=v_~A~0.offset_11, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 1577018#[L88-6]don't care [823] L88-6-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret42#1.base=|v_ULTIMATE.start_main_#t~ret42#1.base_4|, ULTIMATE.start_main_#t~ret42#1.offset=|v_ULTIMATE.start_main_#t~ret42#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret42#1.base, ULTIMATE.start_main_#t~ret42#1.offset] 1577020#[L89]don't care [979] L89-->L89-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1478950#[L89-1]don't care [950] L89-1-->L89-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3| v_~N~0_9) InVars {~N~0=v_~N~0_9} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|, ~N~0=v_~N~0_9} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 1478952#[L89-2]don't care [829] L89-2-->L89-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1589750#[L89-3]don't care [801] L89-3-->L115-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_14|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_8|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_8|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_6|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_8|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_8|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_8|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post59#1, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1] 1196058#[L115-1]don't care [799] L115-1-->L116-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_13|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 1196060#[L116-3]don't care [835] L116-3-->L116-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1415468#[L116-4]don't care [1007] L116-4-->L116-5: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_14|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_14|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_14|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1590082#[L116-5]don't care [1050] L116-5-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1586746#[L37-4]don't care [1028] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_22| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_12|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_22|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1430954#[L38-6]don't care [841] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_24| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_24|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_24|} AuxVars[] AssignedVars[] 1430958#[L37-5]don't care [825] L37-5-->L117-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1561698#[L117-3]don't care [725] L117-3-->L117-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1561700#[L117-4]don't care [820] L117-4-->L117-5: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_15| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_15|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_15|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1459374#[L117-5]don't care [988] L117-5-->L37-6: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1459376#[L37-6]don't care [975] L37-6-->L38-9: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_26| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_26|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 1515042#[L38-9]don't care [879] L38-9-->L37-7: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_28| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_28|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_28|} AuxVars[] AssignedVars[] 1515046#[L37-7]don't care [833] L37-7-->L119-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1536124#[L119-3]don't care [1017] L119-3-->L119-4: Formula: (and (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_9| 0)) (= (store |v_#length_47| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_9| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_16|)) |v_#length_46|) (= (select |v_#valid_54| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_9|) 0) (= |v_#valid_53| (store |v_#valid_54| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_9| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_9| |v_#StackHeapBarrier_7|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #length=|v_#length_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_16|, #valid=|v_#valid_54|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_53|, #length=|v_#length_46|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_16|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, #valid, #length, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset] 1589848#[L119-4]don't care [812] L119-4-->L119-5: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_9| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_10|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_9|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_10|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_10|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_9|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 1521582#[L119-5]don't care [998] L119-5-->L120-8: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc58#1.offset] 1521584#[L120-8]don't care [1020] L120-8-->L120-14: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_15| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1] 1215056#[L120-14]don't care [2022-07-22 11:56:04,026 INFO L750 eck$LassoCheckResult]: Loop: 1215056#[L120-14]don't care [768] L120-14-->L121-2: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_17| |v_ULTIMATE.start_create_fresh_int_array_~size#1_18|) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_17|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_18|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_17|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_18|} AuxVars[] AssignedVars[] 1215058#[L121-2]don't care [897] L121-2-->L121-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_18| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_10|))) (and (= (select |v_#valid_55| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_10|) 1) (= (store |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_10| (store (select |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_10|) .cse0 (select (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_10|) .cse0))) |v_#memory_$Pointer$.base_16|) (<= 0 .cse0) (= |v_#memory_int_39| (store |v_#memory_int_40| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_10| (store (select |v_#memory_int_40| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_10|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_7|))) (= |v_#memory_$Pointer$.offset_16| (store |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_10| (store (select |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_10|) .cse0 (select (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_10|) .cse0)))) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_10| 4) (select |v_#length_48| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_10|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_10|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_18|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_7|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_10|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_40|, #length=|v_#length_48|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_10|, ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_18|, ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_7|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_16|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_10|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_39|, #length=|v_#length_48|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_16|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 1428796#[L121-3]don't care [783] L121-3-->L120-11: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet60#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet60#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet60#1] 1428798#[L120-11]don't care [854] L120-11-->L120-12: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_19| |v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_9|) InVars {ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_19|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_19|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post59#1] 1403202#[L120-12]don't care [986] L120-12-->L120-13: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_10| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~4#1_20|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_10|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~4#1=|v_ULTIMATE.start_create_fresh_int_array_~i~4#1_20|, ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~4#1] 1270898#[L120-13]don't care [901] L120-13-->L120-14: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post59#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post59#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post59#1] 1215056#[L120-14]don't care [2022-07-22 11:56:04,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:04,027 INFO L85 PathProgramCache]: Analyzing trace with hash 314982838, now seen corresponding path program 1 times [2022-07-22 11:56:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:56:04,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122025418] [2022-07-22 11:56:04,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:56:04,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:56:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:04,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:56:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:04,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:56:04,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:04,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2042535276, now seen corresponding path program 1 times [2022-07-22 11:56:04,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:56:04,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452904450] [2022-07-22 11:56:04,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:56:04,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:56:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:04,246 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:56:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:04,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:56:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:04,543 INFO L85 PathProgramCache]: Analyzing trace with hash -933574519, now seen corresponding path program 1 times [2022-07-22 11:56:04,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:56:04,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495782776] [2022-07-22 11:56:04,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:56:04,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:56:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:56:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:56:04,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:56:04,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495782776] [2022-07-22 11:56:04,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495782776] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:56:04,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:56:04,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 11:56:04,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260779746] [2022-07-22 11:56:04,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:56:04,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:56:04,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 11:56:04,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 11:56:04,963 INFO L87 Difference]: Start difference. First operand 198627 states and 816065 transitions. cyclomatic complexity: 617775 Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:56:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:56:29,126 INFO L93 Difference]: Finished difference Result 794170 states and 3134720 transitions. [2022-07-22 11:56:29,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 794170 states and 3134720 transitions.