./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/rangesum10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c00c1225dae238bedea18c737f72ae44fea020a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 17:34:40,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:34:40,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:34:40,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:34:40,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:34:40,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:34:40,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:34:40,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:34:40,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:34:40,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:34:40,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:34:40,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:34:40,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:34:40,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:34:40,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:34:40,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:34:40,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:34:40,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:34:40,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:34:40,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:34:40,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:34:40,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:34:40,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:34:40,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:34:40,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:34:40,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:34:40,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:34:40,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:34:40,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:34:40,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:34:40,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:34:40,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:34:40,950 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:34:40,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:34:40,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:34:40,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:34:40,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:34:40,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:34:40,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:34:40,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:34:40,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:34:40,956 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:34:40,975 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:34:40,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:34:40,976 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:34:40,976 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:34:40,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:34:40,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:34:40,978 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:34:40,978 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:34:40,979 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:34:40,979 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:34:40,979 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:34:40,979 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:34:40,980 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:34:40,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:34:40,980 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:34:40,980 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:34:40,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:34:40,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:34:40,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:34:40,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:34:40,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:34:40,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:34:40,981 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:34:40,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:34:40,981 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:34:40,981 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:34:40,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:34:40,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:34:40,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:34:40,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:34:40,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:34:40,982 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:34:40,983 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:34:40,983 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c00c1225dae238bedea18c737f72ae44fea020a [2021-08-27 17:34:41,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:34:41,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:34:41,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:34:41,275 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:34:41,275 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:34:41,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum10.i [2021-08-27 17:34:41,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fbb6c76f/dd57dd68585f48139eec363e7c84ac48/FLAG205e82485 [2021-08-27 17:34:41,708 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:34:41,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i [2021-08-27 17:34:41,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fbb6c76f/dd57dd68585f48139eec363e7c84ac48/FLAG205e82485 [2021-08-27 17:34:41,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fbb6c76f/dd57dd68585f48139eec363e7c84ac48 [2021-08-27 17:34:41,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:34:41,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:34:41,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:34:41,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:34:41,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:34:41,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:34:41" (1/1) ... [2021-08-27 17:34:41,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0e1674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:41, skipping insertion in model container [2021-08-27 17:34:41,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:34:41" (1/1) ... [2021-08-27 17:34:41,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:34:41,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:34:41,914 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i[1465,1478] [2021-08-27 17:34:41,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:34:41,935 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:34:41,964 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i[1465,1478] [2021-08-27 17:34:41,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:34:41,975 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:34:41,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:41 WrapperNode [2021-08-27 17:34:41,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:34:41,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:34:41,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:34:41,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:34:41,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:41" (1/1) ... [2021-08-27 17:34:41,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:41" (1/1) ... [2021-08-27 17:34:42,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:34:42,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:34:42,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:34:42,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:34:42,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:41" (1/1) ... [2021-08-27 17:34:42,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:41" (1/1) ... [2021-08-27 17:34:42,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:41" (1/1) ... [2021-08-27 17:34:42,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:41" (1/1) ... [2021-08-27 17:34:42,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:41" (1/1) ... [2021-08-27 17:34:42,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:41" (1/1) ... [2021-08-27 17:34:42,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:41" (1/1) ... [2021-08-27 17:34:42,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:34:42,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:34:42,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:34:42,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:34:42,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:41" (1/1) ... [2021-08-27 17:34:42,070 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:42,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:42,086 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) [2021-08-27 17:34:42,100 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 [2021-08-27 17:34:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 17:34:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:34:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 17:34:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:34:42,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:34:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 17:34:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 17:34:42,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:34:42,483 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-08-27 17:34:42,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:34:42 BoogieIcfgContainer [2021-08-27 17:34:42,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:34:42,485 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:34:42,485 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:34:42,487 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:34:42,487 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:34:42,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:34:41" (1/3) ... [2021-08-27 17:34:42,488 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b9aedc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:34:42, skipping insertion in model container [2021-08-27 17:34:42,488 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:34:42,489 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:34:41" (2/3) ... [2021-08-27 17:34:42,489 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b9aedc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:34:42, skipping insertion in model container [2021-08-27 17:34:42,489 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:34:42,489 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:34:42" (3/3) ... [2021-08-27 17:34:42,490 INFO L389 chiAutomizerObserver]: Analyzing ICFG rangesum10.i [2021-08-27 17:34:42,517 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:34:42,518 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:34:42,518 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:34:42,518 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:34:42,518 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:34:42,518 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:34:42,518 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:34:42,518 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:34:42,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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) [2021-08-27 17:34:42,541 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-08-27 17:34:42,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:42,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:42,544 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:34:42,545 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:34:42,545 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:34:42,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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) [2021-08-27 17:34:42,548 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-08-27 17:34:42,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:42,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:42,549 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 17:34:42,549 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:34:42,554 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 7#L-1true havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 22#L17-3true [2021-08-27 17:34:42,554 INFO L793 eck$LassoCheckResult]: Loop: 22#L17-3true assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 11#L17-2true init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 22#L17-3true [2021-08-27 17:34:42,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:42,559 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 17:34:42,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:42,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639883216] [2021-08-27 17:34:42,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:42,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:42,641 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:42,678 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:42,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:42,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-27 17:34:42,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:42,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615979455] [2021-08-27 17:34:42,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:42,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:42,695 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:42,705 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:42,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:42,707 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-27 17:34:42,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:42,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913052208] [2021-08-27 17:34:42,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:42,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:42,718 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:42,730 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:43,329 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:34:43,330 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:34:43,330 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:34:43,330 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:34:43,330 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:34:43,330 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:43,330 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:34:43,330 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:34:43,330 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration1_Lasso [2021-08-27 17:34:43,330 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:34:43,330 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:34:43,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:43,959 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:34:43,961 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:34:43,962 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:43,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:43,973 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) [2021-08-27 17:34:43,984 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 [2021-08-27 17:34:43,985 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 [2021-08-27 17:34:43,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:43,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:43,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:43,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:43,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:43,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:43,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:44,005 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:44,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-08-27 17:34:44,023 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:44,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:44,024 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) [2021-08-27 17:34:44,026 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 [2021-08-27 17:34:44,026 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 [2021-08-27 17:34:44,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:44,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:44,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:44,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:44,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:44,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:44,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:44,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:44,059 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 [2021-08-27 17:34:44,059 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:44,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:44,069 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) [2021-08-27 17:34:44,072 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 [2021-08-27 17:34:44,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 [2021-08-27 17:34:44,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:44,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:44,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:44,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:44,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:44,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:44,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:44,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:44,113 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 [2021-08-27 17:34:44,114 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:44,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:44,114 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) [2021-08-27 17:34:44,116 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 [2021-08-27 17:34:44,117 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 [2021-08-27 17:34:44,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:44,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:44,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:44,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:44,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:44,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:44,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:44,170 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 [2021-08-27 17:34:44,170 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:44,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:44,171 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) [2021-08-27 17:34:44,171 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 [2021-08-27 17:34:44,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:44,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:44,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:44,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:44,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:44,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:44,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:44,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:44,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:44,198 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 [2021-08-27 17:34:44,198 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:44,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:44,199 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) [2021-08-27 17:34:44,199 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 [2021-08-27 17:34:44,201 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 [2021-08-27 17:34:44,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:44,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:44,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:44,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:44,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:44,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:44,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:44,210 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:44,225 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 [2021-08-27 17:34:44,226 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:44,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:44,227 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) [2021-08-27 17:34:44,228 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 [2021-08-27 17:34:44,229 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 [2021-08-27 17:34:44,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:44,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:44,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:44,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:44,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:44,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:44,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:44,257 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 [2021-08-27 17:34:44,257 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:44,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:44,258 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) [2021-08-27 17:34:44,258 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 [2021-08-27 17:34:44,260 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 [2021-08-27 17:34:44,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:44,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:44,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:44,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:44,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:44,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:44,289 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:34:44,325 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-08-27 17:34:44,325 INFO L444 ModelExtractionUtils]: 4 out of 25 variables were initially zero. Simplification set additionally 18 variables to zero. [2021-08-27 17:34:44,327 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:44,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:44,341 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) [2021-08-27 17:34:44,349 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:34:44,358 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 [2021-08-27 17:34:44,373 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:34:44,373 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:34:44,374 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0, v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_1) = -8*ULTIMATE.start_init_nondet_~i~0 + 19*v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_1 Supporting invariants [] [2021-08-27 17:34:44,392 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 [2021-08-27 17:34:44,429 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-08-27 17:34:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:44,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:34:44,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:44,511 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:34:44,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:44,522 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 [2021-08-27 17:34:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:44,567 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 17:34:44,568 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:44,626 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 78 states and 122 transitions. Complement of second has 7 states. [2021-08-27 17:34:44,627 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 [2021-08-27 17:34:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2021-08-27 17:34:44,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-27 17:34:44,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:34:44,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-27 17:34:44,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:34:44,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-27 17:34:44,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:34:44,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 122 transitions. [2021-08-27 17:34:44,643 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:44,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 22 states and 32 transitions. [2021-08-27 17:34:44,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-27 17:34:44,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:34:44,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2021-08-27 17:34:44,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:44,655 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2021-08-27 17:34:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2021-08-27 17:34:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-08-27 17:34:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 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) [2021-08-27 17:34:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2021-08-27 17:34:44,675 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2021-08-27 17:34:44,675 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2021-08-27 17:34:44,676 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:34:44,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2021-08-27 17:34:44,676 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:44,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:44,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:44,677 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-27 17:34:44,677 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:44,677 INFO L791 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 190#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 201#L17-3 assume !(init_nondet_~i~0 < 10); 196#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 197#L28-3 [2021-08-27 17:34:44,677 INFO L793 eck$LassoCheckResult]: Loop: 197#L28-3 assume !!(rangesum_~i~1 < 10); 198#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 199#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 197#L28-3 [2021-08-27 17:34:44,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:44,678 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-08-27 17:34:44,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:44,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851992496] [2021-08-27 17:34:44,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:44,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:44,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:44,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851992496] [2021-08-27 17:34:44,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851992496] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:34:44,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:34:44,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:34:44,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740126679] [2021-08-27 17:34:44,710 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:44,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:44,710 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2021-08-27 17:34:44,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:44,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534890652] [2021-08-27 17:34:44,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:44,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:44,715 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:44,718 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:44,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:44,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:34:44,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:34:44,765 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:44,773 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2021-08-27 17:34:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 17:34:44,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2021-08-27 17:34:44,774 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:44,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 32 transitions. [2021-08-27 17:34:44,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:34:44,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:34:44,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2021-08-27 17:34:44,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:44,775 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2021-08-27 17:34:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2021-08-27 17:34:44,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-08-27 17:34:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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) [2021-08-27 17:34:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2021-08-27 17:34:44,776 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-08-27 17:34:44,776 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-08-27 17:34:44,777 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:34:44,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2021-08-27 17:34:44,777 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:44,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:44,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:44,777 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:34:44,777 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:44,778 INFO L791 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 241#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 253#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 254#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 255#L17-3 assume !(init_nondet_~i~0 < 10); 249#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 250#L28-3 [2021-08-27 17:34:44,778 INFO L793 eck$LassoCheckResult]: Loop: 250#L28-3 assume !!(rangesum_~i~1 < 10); 247#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 248#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 250#L28-3 [2021-08-27 17:34:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:44,778 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-08-27 17:34:44,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:44,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027838692] [2021-08-27 17:34:44,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:44,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:44,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:44,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027838692] [2021-08-27 17:34:44,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027838692] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:44,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219295374] [2021-08-27 17:34:44,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:44,804 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:44,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:44,817 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:44,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-27 17:34:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:44,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 17:34:44,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:44,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219295374] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:44,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:44,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 17:34:44,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080586036] [2021-08-27 17:34:44,894 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:44,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:44,895 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2021-08-27 17:34:44,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:44,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081780437] [2021-08-27 17:34:44,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:44,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:44,904 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:44,917 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:44,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:44,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:34:44,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:34:44,965 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) [2021-08-27 17:34:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:44,983 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2021-08-27 17:34:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:34:44,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2021-08-27 17:34:44,987 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:44,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 34 transitions. [2021-08-27 17:34:44,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:34:44,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:34:44,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2021-08-27 17:34:44,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:44,991 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2021-08-27 17:34:44,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2021-08-27 17:34:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-08-27 17:34:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 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) [2021-08-27 17:34:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2021-08-27 17:34:44,994 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-08-27 17:34:44,994 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-08-27 17:34:44,994 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:34:44,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2021-08-27 17:34:44,995 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:44,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:44,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:44,996 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2021-08-27 17:34:44,996 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:44,996 INFO L791 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 311#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 322#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 323#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 324#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 325#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 333#L17-3 assume !(init_nondet_~i~0 < 10); 317#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 318#L28-3 [2021-08-27 17:34:44,996 INFO L793 eck$LassoCheckResult]: Loop: 318#L28-3 assume !!(rangesum_~i~1 < 10); 319#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 320#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 318#L28-3 [2021-08-27 17:34:44,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:44,997 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2021-08-27 17:34:44,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:44,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914899914] [2021-08-27 17:34:44,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:44,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:45,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:45,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914899914] [2021-08-27 17:34:45,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914899914] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:45,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563071625] [2021-08-27 17:34:45,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:34:45,033 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:45,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:45,041 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:45,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-27 17:34:45,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:34:45,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:45,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:34:45,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:45,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563071625] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:45,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:45,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-27 17:34:45,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83599283] [2021-08-27 17:34:45,125 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:45,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:45,125 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2021-08-27 17:34:45,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:45,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689909720] [2021-08-27 17:34:45,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:45,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:45,133 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:45,137 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:45,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:45,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 17:34:45,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 17:34:45,196 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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) [2021-08-27 17:34:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:45,216 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2021-08-27 17:34:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:34:45,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2021-08-27 17:34:45,219 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:45,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 36 transitions. [2021-08-27 17:34:45,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:34:45,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:34:45,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2021-08-27 17:34:45,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:45,220 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2021-08-27 17:34:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2021-08-27 17:34:45,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-08-27 17:34:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 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) [2021-08-27 17:34:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2021-08-27 17:34:45,223 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-08-27 17:34:45,223 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-08-27 17:34:45,223 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 17:34:45,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2021-08-27 17:34:45,224 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:45,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:45,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:45,225 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2021-08-27 17:34:45,225 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:45,225 INFO L791 eck$LassoCheckResult]: Stem: 391#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 392#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 403#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 404#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 405#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 406#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 416#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 415#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 414#L17-3 assume !(init_nondet_~i~0 < 10); 398#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 399#L28-3 [2021-08-27 17:34:45,225 INFO L793 eck$LassoCheckResult]: Loop: 399#L28-3 assume !!(rangesum_~i~1 < 10); 400#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 401#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 399#L28-3 [2021-08-27 17:34:45,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:45,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2021-08-27 17:34:45,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:45,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576904873] [2021-08-27 17:34:45,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:45,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:45,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:45,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576904873] [2021-08-27 17:34:45,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576904873] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:45,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921597354] [2021-08-27 17:34:45,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:34:45,281 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:45,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:45,283 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:45,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-27 17:34:45,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 17:34:45,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:45,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 17:34:45,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:45,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921597354] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:45,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:45,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 17:34:45,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336919755] [2021-08-27 17:34:45,393 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:45,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:45,394 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2021-08-27 17:34:45,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:45,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136009530] [2021-08-27 17:34:45,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:45,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:45,406 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:45,413 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:45,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:45,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 17:34:45,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 17:34:45,474 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 14 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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) [2021-08-27 17:34:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:45,490 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-08-27 17:34:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 17:34:45,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2021-08-27 17:34:45,491 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:45,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 38 transitions. [2021-08-27 17:34:45,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:34:45,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:34:45,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2021-08-27 17:34:45,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:45,493 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2021-08-27 17:34:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2021-08-27 17:34:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-08-27 17:34:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 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) [2021-08-27 17:34:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2021-08-27 17:34:45,500 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-27 17:34:45,500 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-27 17:34:45,500 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 17:34:45,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2021-08-27 17:34:45,501 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:45,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:45,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:45,501 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-08-27 17:34:45,501 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:45,502 INFO L791 eck$LassoCheckResult]: Stem: 483#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 484#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 495#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 496#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 497#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 498#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 503#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 510#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 509#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 508#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 507#L17-3 assume !(init_nondet_~i~0 < 10); 490#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 491#L28-3 [2021-08-27 17:34:45,502 INFO L793 eck$LassoCheckResult]: Loop: 491#L28-3 assume !!(rangesum_~i~1 < 10); 492#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 493#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 491#L28-3 [2021-08-27 17:34:45,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:45,502 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2021-08-27 17:34:45,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:45,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501698106] [2021-08-27 17:34:45,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:45,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:45,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:45,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501698106] [2021-08-27 17:34:45,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501698106] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:45,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760121160] [2021-08-27 17:34:45,553 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 17:34:45,553 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:45,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:45,557 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:45,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-27 17:34:45,618 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 17:34:45,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:45,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:34:45,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:45,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760121160] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:45,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:45,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-08-27 17:34:45,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622816514] [2021-08-27 17:34:45,662 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:45,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:45,662 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2021-08-27 17:34:45,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:45,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990302673] [2021-08-27 17:34:45,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:45,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:45,667 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:45,678 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:45,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:45,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 17:34:45,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 17:34:45,721 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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) [2021-08-27 17:34:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:45,740 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2021-08-27 17:34:45,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:34:45,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2021-08-27 17:34:45,741 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:45,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2021-08-27 17:34:45,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:34:45,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:34:45,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2021-08-27 17:34:45,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:45,742 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2021-08-27 17:34:45,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2021-08-27 17:34:45,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-08-27 17:34:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 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) [2021-08-27 17:34:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2021-08-27 17:34:45,745 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2021-08-27 17:34:45,745 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2021-08-27 17:34:45,745 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 17:34:45,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2021-08-27 17:34:45,746 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:45,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:45,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:45,746 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-08-27 17:34:45,746 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:45,746 INFO L791 eck$LassoCheckResult]: Stem: 586#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 587#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 599#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 600#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 601#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 602#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 606#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 615#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 614#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 613#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 612#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 611#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 610#L17-3 assume !(init_nondet_~i~0 < 10); 593#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 594#L28-3 [2021-08-27 17:34:45,746 INFO L793 eck$LassoCheckResult]: Loop: 594#L28-3 assume !!(rangesum_~i~1 < 10); 595#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 596#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 594#L28-3 [2021-08-27 17:34:45,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:45,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2021-08-27 17:34:45,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:45,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898713247] [2021-08-27 17:34:45,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:45,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:45,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:45,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898713247] [2021-08-27 17:34:45,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898713247] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:45,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881560605] [2021-08-27 17:34:45,815 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 17:34:45,815 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:45,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:45,816 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:45,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-27 17:34:45,877 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-08-27 17:34:45,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:45,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 17:34:45,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:45,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881560605] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:45,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:45,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-08-27 17:34:45,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905386181] [2021-08-27 17:34:45,939 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:45,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:45,939 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2021-08-27 17:34:45,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:45,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214404528] [2021-08-27 17:34:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:45,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:45,942 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:45,954 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:46,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:46,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 17:34:46,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-27 17:34:46,005 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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) [2021-08-27 17:34:46,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:46,023 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2021-08-27 17:34:46,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 17:34:46,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 42 transitions. [2021-08-27 17:34:46,023 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:46,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 42 transitions. [2021-08-27 17:34:46,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:34:46,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:34:46,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2021-08-27 17:34:46,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:46,025 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2021-08-27 17:34:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2021-08-27 17:34:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-08-27 17:34:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 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) [2021-08-27 17:34:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2021-08-27 17:34:46,027 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2021-08-27 17:34:46,027 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2021-08-27 17:34:46,027 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 17:34:46,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2021-08-27 17:34:46,028 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:46,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:46,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:46,028 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2021-08-27 17:34:46,028 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:46,029 INFO L791 eck$LassoCheckResult]: Stem: 700#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 701#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 712#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 713#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 714#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 715#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 720#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 731#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 730#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 729#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 728#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 727#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 726#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 725#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 724#L17-3 assume !(init_nondet_~i~0 < 10); 707#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 708#L28-3 [2021-08-27 17:34:46,029 INFO L793 eck$LassoCheckResult]: Loop: 708#L28-3 assume !!(rangesum_~i~1 < 10); 709#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 710#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 708#L28-3 [2021-08-27 17:34:46,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:46,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2021-08-27 17:34:46,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:46,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654762330] [2021-08-27 17:34:46,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:46,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:46,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:46,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654762330] [2021-08-27 17:34:46,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654762330] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:46,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246723817] [2021-08-27 17:34:46,085 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 17:34:46,085 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:46,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:46,086 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:46,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-27 17:34:46,192 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-08-27 17:34:46,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:46,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 17:34:46,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:46,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246723817] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:46,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:46,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-08-27 17:34:46,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032100029] [2021-08-27 17:34:46,235 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:46,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:46,236 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 7 times [2021-08-27 17:34:46,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:46,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627616730] [2021-08-27 17:34:46,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:46,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:46,238 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:46,240 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:46,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:46,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 17:34:46,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-27 17:34:46,281 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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) [2021-08-27 17:34:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:46,305 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2021-08-27 17:34:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 17:34:46,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2021-08-27 17:34:46,307 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:46,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 44 transitions. [2021-08-27 17:34:46,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:34:46,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:34:46,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2021-08-27 17:34:46,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:46,307 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2021-08-27 17:34:46,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2021-08-27 17:34:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-08-27 17:34:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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) [2021-08-27 17:34:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2021-08-27 17:34:46,309 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-08-27 17:34:46,309 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-08-27 17:34:46,309 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 17:34:46,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2021-08-27 17:34:46,309 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:46,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:46,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:46,310 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2021-08-27 17:34:46,310 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:46,310 INFO L791 eck$LassoCheckResult]: Stem: 825#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 826#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 837#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 838#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 839#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 840#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 845#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 858#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 857#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 856#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 855#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 854#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 853#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 852#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 851#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 850#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 849#L17-3 assume !(init_nondet_~i~0 < 10); 832#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 833#L28-3 [2021-08-27 17:34:46,310 INFO L793 eck$LassoCheckResult]: Loop: 833#L28-3 assume !!(rangesum_~i~1 < 10); 834#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 835#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 833#L28-3 [2021-08-27 17:34:46,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:46,310 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2021-08-27 17:34:46,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:46,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169979848] [2021-08-27 17:34:46,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:46,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:46,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:46,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169979848] [2021-08-27 17:34:46,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169979848] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:46,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062006838] [2021-08-27 17:34:46,387 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 17:34:46,387 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:46,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:46,388 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:46,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-27 17:34:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:46,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 17:34:46,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:46,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062006838] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:46,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:46,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-08-27 17:34:46,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86002178] [2021-08-27 17:34:46,518 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:46,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:46,519 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 8 times [2021-08-27 17:34:46,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:46,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873818559] [2021-08-27 17:34:46,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:46,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:46,522 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:46,524 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:46,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:46,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 17:34:46,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-08-27 17:34:46,560 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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) [2021-08-27 17:34:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:46,586 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2021-08-27 17:34:46,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 17:34:46,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2021-08-27 17:34:46,587 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:46,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2021-08-27 17:34:46,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:34:46,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:34:46,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2021-08-27 17:34:46,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:46,592 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2021-08-27 17:34:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2021-08-27 17:34:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2021-08-27 17:34:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.25) internal successors, (45), 35 states have internal predecessors, (45), 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) [2021-08-27 17:34:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2021-08-27 17:34:46,606 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2021-08-27 17:34:46,606 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2021-08-27 17:34:46,606 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 17:34:46,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2021-08-27 17:34:46,606 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:46,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:46,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:46,607 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2021-08-27 17:34:46,607 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:46,607 INFO L791 eck$LassoCheckResult]: Stem: 961#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 962#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 973#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 974#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 975#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 976#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 981#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 996#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 995#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 994#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 993#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 992#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 991#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 990#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 989#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 988#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 987#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 986#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 985#L17-3 assume !(init_nondet_~i~0 < 10); 968#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 969#L28-3 [2021-08-27 17:34:46,608 INFO L793 eck$LassoCheckResult]: Loop: 969#L28-3 assume !!(rangesum_~i~1 < 10); 970#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 971#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 969#L28-3 [2021-08-27 17:34:46,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:46,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2021-08-27 17:34:46,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:46,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085828747] [2021-08-27 17:34:46,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:46,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:46,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:46,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085828747] [2021-08-27 17:34:46,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085828747] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:46,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660836092] [2021-08-27 17:34:46,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:34:46,692 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:46,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:46,693 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:46,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-27 17:34:46,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:34:46,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:46,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 17:34:46,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:46,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660836092] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:46,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:46,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-08-27 17:34:46,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361661371] [2021-08-27 17:34:46,829 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:46,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:46,830 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 9 times [2021-08-27 17:34:46,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:46,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114895783] [2021-08-27 17:34:46,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:46,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:46,833 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:46,836 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:46,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:46,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 17:34:46,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-08-27 17:34:46,886 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 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) [2021-08-27 17:34:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:46,921 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2021-08-27 17:34:46,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 17:34:46,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2021-08-27 17:34:46,922 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:46,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2021-08-27 17:34:46,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:34:46,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:34:46,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2021-08-27 17:34:46,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:46,924 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2021-08-27 17:34:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2021-08-27 17:34:46,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2021-08-27 17:34:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.236842105263158) internal successors, (47), 37 states have internal predecessors, (47), 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) [2021-08-27 17:34:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2021-08-27 17:34:46,932 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2021-08-27 17:34:46,932 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2021-08-27 17:34:46,932 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 17:34:46,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2021-08-27 17:34:46,933 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:46,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:46,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:46,934 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2021-08-27 17:34:46,934 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:46,934 INFO L791 eck$LassoCheckResult]: Stem: 1108#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 1109#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1120#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1121#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1122#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1123#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1128#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1145#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1144#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1143#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1142#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1141#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1140#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1139#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1138#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1137#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1136#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1135#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1134#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1133#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1132#L17-3 assume !(init_nondet_~i~0 < 10); 1115#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1116#L28-3 [2021-08-27 17:34:46,934 INFO L793 eck$LassoCheckResult]: Loop: 1116#L28-3 assume !!(rangesum_~i~1 < 10); 1117#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1118#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1116#L28-3 [2021-08-27 17:34:46,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:46,934 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2021-08-27 17:34:46,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:46,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184945497] [2021-08-27 17:34:46,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:46,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:47,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:47,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184945497] [2021-08-27 17:34:47,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184945497] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:47,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696123065] [2021-08-27 17:34:47,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:34:47,037 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:47,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:47,038 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:47,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-27 17:34:47,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-08-27 17:34:47,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:47,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 17:34:47,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:47,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696123065] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:47,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:47,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2021-08-27 17:34:47,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690669032] [2021-08-27 17:34:47,248 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:47,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:47,248 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 10 times [2021-08-27 17:34:47,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:47,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44256483] [2021-08-27 17:34:47,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:47,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:47,252 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:47,254 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:47,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:47,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 17:34:47,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-08-27 17:34:47,299 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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) [2021-08-27 17:34:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:47,337 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2021-08-27 17:34:47,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 17:34:47,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2021-08-27 17:34:47,339 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:47,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2021-08-27 17:34:47,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:34:47,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:34:47,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2021-08-27 17:34:47,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:47,339 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-08-27 17:34:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2021-08-27 17:34:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-08-27 17:34:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:34:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2021-08-27 17:34:47,340 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-08-27 17:34:47,340 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-08-27 17:34:47,340 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 17:34:47,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2021-08-27 17:34:47,340 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:47,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:47,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:47,341 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2021-08-27 17:34:47,341 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:47,341 INFO L791 eck$LassoCheckResult]: Stem: 1265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 1266#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1277#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1278#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1279#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1280#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1285#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1304#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1303#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1302#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1301#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1300#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1299#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1298#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1297#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1296#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1295#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1294#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1293#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1292#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1291#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1290#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1289#L17-3 assume !(init_nondet_~i~0 < 10); 1272#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1273#L28-3 [2021-08-27 17:34:47,341 INFO L793 eck$LassoCheckResult]: Loop: 1273#L28-3 assume !!(rangesum_~i~1 < 10); 1274#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1275#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1273#L28-3 [2021-08-27 17:34:47,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:47,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2021-08-27 17:34:47,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:47,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290869552] [2021-08-27 17:34:47,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:47,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:47,349 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:47,360 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:47,361 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 11 times [2021-08-27 17:34:47,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:47,361 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801238827] [2021-08-27 17:34:47,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:47,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:47,363 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:47,365 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:47,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:47,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1328180093, now seen corresponding path program 1 times [2021-08-27 17:34:47,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:47,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873057095] [2021-08-27 17:34:47,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:47,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:34:47,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:47,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873057095] [2021-08-27 17:34:47,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873057095] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:34:47,382 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:34:47,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:34:47,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506857660] [2021-08-27 17:34:47,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:47,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:34:47,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:34:47,418 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2021-08-27 17:34:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:47,438 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2021-08-27 17:34:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 17:34:47,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2021-08-27 17:34:47,439 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:47,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 58 transitions. [2021-08-27 17:34:47,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-08-27 17:34:47,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-08-27 17:34:47,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 58 transitions. [2021-08-27 17:34:47,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:47,441 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 58 transitions. [2021-08-27 17:34:47,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 58 transitions. [2021-08-27 17:34:47,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2021-08-27 17:34:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 45 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) [2021-08-27 17:34:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2021-08-27 17:34:47,444 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2021-08-27 17:34:47,444 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2021-08-27 17:34:47,444 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 17:34:47,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2021-08-27 17:34:47,444 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:47,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:47,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:47,445 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:47,445 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:47,445 INFO L791 eck$LassoCheckResult]: Stem: 1362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 1363#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1375#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1376#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1377#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1378#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1407#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1406#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1405#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1404#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1403#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1402#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1401#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1400#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1399#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1398#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1397#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1396#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1395#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1394#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1393#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1390#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1389#L17-3 assume !(init_nondet_~i~0 < 10); 1368#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1369#L28-3 assume !!(rangesum_~i~1 < 10); 1370#L29 assume !(rangesum_~i~1 > 5); 1371#L28-2 [2021-08-27 17:34:47,445 INFO L793 eck$LassoCheckResult]: Loop: 1371#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1372#L28-3 assume !!(rangesum_~i~1 < 10); 1392#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1371#L28-2 [2021-08-27 17:34:47,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:47,445 INFO L82 PathProgramCache]: Analyzing trace with hash -95702812, now seen corresponding path program 1 times [2021-08-27 17:34:47,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:47,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591887503] [2021-08-27 17:34:47,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:47,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:47,455 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:47,473 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:47,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:47,473 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 12 times [2021-08-27 17:34:47,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:47,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640179001] [2021-08-27 17:34:47,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:47,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:47,476 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:47,480 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:47,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:47,480 INFO L82 PathProgramCache]: Analyzing trace with hash 775842814, now seen corresponding path program 1 times [2021-08-27 17:34:47,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:47,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124555843] [2021-08-27 17:34:47,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:47,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:47,505 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:34:47,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:47,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124555843] [2021-08-27 17:34:47,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124555843] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:47,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495414487] [2021-08-27 17:34:47,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:47,506 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:47,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:47,509 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:47,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-27 17:34:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:47,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 17:34:47,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:34:47,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495414487] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:47,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:47,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2021-08-27 17:34:47,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725014213] [2021-08-27 17:34:47,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:47,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:34:47,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:34:47,742 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. cyclomatic complexity: 14 Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-08-27 17:34:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:47,793 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2021-08-27 17:34:47,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:34:47,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 67 transitions. [2021-08-27 17:34:47,794 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:47,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 67 transitions. [2021-08-27 17:34:47,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-08-27 17:34:47,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-08-27 17:34:47,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2021-08-27 17:34:47,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:47,796 INFO L681 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2021-08-27 17:34:47,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2021-08-27 17:34:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2021-08-27 17:34:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 54 states have internal predecessors, (64), 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) [2021-08-27 17:34:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2021-08-27 17:34:47,802 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2021-08-27 17:34:47,802 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2021-08-27 17:34:47,802 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 17:34:47,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 64 transitions. [2021-08-27 17:34:47,803 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:47,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:47,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:47,804 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 1, 1, 1, 1, 1] [2021-08-27 17:34:47,805 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:47,806 INFO L791 eck$LassoCheckResult]: Stem: 1560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 1561#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1574#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1575#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1576#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1577#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1611#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1609#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1608#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1607#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1606#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1605#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1604#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1602#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1601#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1600#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1599#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1598#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1595#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1594#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1591#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1590#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1589#L17-3 assume !(init_nondet_~i~0 < 10); 1566#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1567#L28-3 assume !!(rangesum_~i~1 < 10); 1603#L29 assume !(rangesum_~i~1 > 5); 1570#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1571#L28-3 assume !!(rangesum_~i~1 < 10); 1568#L29 assume !(rangesum_~i~1 > 5); 1569#L28-2 [2021-08-27 17:34:47,806 INFO L793 eck$LassoCheckResult]: Loop: 1569#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1596#L28-3 assume !!(rangesum_~i~1 < 10); 1597#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1569#L28-2 [2021-08-27 17:34:47,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:47,806 INFO L82 PathProgramCache]: Analyzing trace with hash 775842816, now seen corresponding path program 1 times [2021-08-27 17:34:47,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:47,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696118997] [2021-08-27 17:34:47,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:47,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:47,818 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:47,834 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:47,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:47,834 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 13 times [2021-08-27 17:34:47,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:47,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854337652] [2021-08-27 17:34:47,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:47,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:47,838 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:47,842 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:47,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:47,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1914342242, now seen corresponding path program 2 times [2021-08-27 17:34:47,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:47,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908611004] [2021-08-27 17:34:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:47,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:34:47,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:47,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908611004] [2021-08-27 17:34:47,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908611004] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:47,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017275060] [2021-08-27 17:34:47,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:34:47,890 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:47,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:47,891 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:47,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-08-27 17:34:47,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:34:47,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:47,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:34:47,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:34:48,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017275060] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:48,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:48,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 17:34:48,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173390571] [2021-08-27 17:34:48,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:48,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 17:34:48,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 17:34:48,126 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) [2021-08-27 17:34:48,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:48,186 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2021-08-27 17:34:48,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:34:48,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 76 transitions. [2021-08-27 17:34:48,187 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:48,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 76 transitions. [2021-08-27 17:34:48,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-08-27 17:34:48,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-08-27 17:34:48,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 76 transitions. [2021-08-27 17:34:48,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:48,188 INFO L681 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2021-08-27 17:34:48,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 76 transitions. [2021-08-27 17:34:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2021-08-27 17:34:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.140625) internal successors, (73), 63 states have internal predecessors, (73), 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) [2021-08-27 17:34:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2021-08-27 17:34:48,189 INFO L704 BuchiCegarLoop]: Abstraction has 64 states and 73 transitions. [2021-08-27 17:34:48,189 INFO L587 BuchiCegarLoop]: Abstraction has 64 states and 73 transitions. [2021-08-27 17:34:48,189 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-27 17:34:48,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 73 transitions. [2021-08-27 17:34:48,190 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:48,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:48,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:48,190 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 2, 1, 1, 1, 1] [2021-08-27 17:34:48,190 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:48,191 INFO L791 eck$LassoCheckResult]: Stem: 1786#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 1787#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1800#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1801#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1802#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1803#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1837#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1836#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1835#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1834#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1833#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1832#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1831#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1830#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1829#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1828#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1827#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1826#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1825#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1824#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1823#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1817#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1816#L17-3 assume !(init_nondet_~i~0 < 10); 1792#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1793#L28-3 assume !!(rangesum_~i~1 < 10); 1838#L29 assume !(rangesum_~i~1 > 5); 1796#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1797#L28-3 assume !!(rangesum_~i~1 < 10); 1844#L29 assume !(rangesum_~i~1 > 5); 1843#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1811#L28-3 assume !!(rangesum_~i~1 < 10); 1794#L29 assume !(rangesum_~i~1 > 5); 1795#L28-2 [2021-08-27 17:34:48,191 INFO L793 eck$LassoCheckResult]: Loop: 1795#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1820#L28-3 assume !!(rangesum_~i~1 < 10); 1821#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1795#L28-2 [2021-08-27 17:34:48,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:48,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1914342244, now seen corresponding path program 2 times [2021-08-27 17:34:48,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:48,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399554381] [2021-08-27 17:34:48,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:48,191 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:48,199 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:48,208 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:48,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:48,208 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 14 times [2021-08-27 17:34:48,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:48,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420282618] [2021-08-27 17:34:48,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:48,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:48,211 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:48,213 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:48,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1594065278, now seen corresponding path program 3 times [2021-08-27 17:34:48,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:48,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471943755] [2021-08-27 17:34:48,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:48,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:34:48,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:48,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471943755] [2021-08-27 17:34:48,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471943755] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:48,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787860079] [2021-08-27 17:34:48,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:34:48,253 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:48,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:48,254 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:48,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-08-27 17:34:48,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-27 17:34:48,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:48,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 17:34:48,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:34:48,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787860079] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:48,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:48,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-27 17:34:48,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136893256] [2021-08-27 17:34:48,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:48,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 17:34:48,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 17:34:48,506 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. cyclomatic complexity: 14 Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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) [2021-08-27 17:34:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:48,567 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2021-08-27 17:34:48,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 17:34:48,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 85 transitions. [2021-08-27 17:34:48,568 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:48,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 85 transitions. [2021-08-27 17:34:48,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-08-27 17:34:48,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-08-27 17:34:48,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 85 transitions. [2021-08-27 17:34:48,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:48,569 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 85 transitions. [2021-08-27 17:34:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 85 transitions. [2021-08-27 17:34:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2021-08-27 17:34:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 72 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) [2021-08-27 17:34:48,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2021-08-27 17:34:48,570 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 82 transitions. [2021-08-27 17:34:48,570 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 82 transitions. [2021-08-27 17:34:48,570 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-27 17:34:48,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 82 transitions. [2021-08-27 17:34:48,570 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:48,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:48,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:48,571 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 3, 1, 1, 1, 1] [2021-08-27 17:34:48,571 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:48,571 INFO L791 eck$LassoCheckResult]: Stem: 2040#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 2041#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2053#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2054#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2055#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2056#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2090#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2089#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2088#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2087#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2086#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2085#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2084#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2083#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2082#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2081#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2080#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2079#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2078#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2077#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2076#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2069#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2068#L17-3 assume !(init_nondet_~i~0 < 10); 2046#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2047#L28-3 assume !!(rangesum_~i~1 < 10); 2097#L29 assume !(rangesum_~i~1 > 5); 2050#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2051#L28-3 assume !!(rangesum_~i~1 < 10); 2048#L29 assume !(rangesum_~i~1 > 5); 2049#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2095#L28-3 assume !!(rangesum_~i~1 < 10); 2094#L29 assume !(rangesum_~i~1 > 5); 2093#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2092#L28-3 assume !!(rangesum_~i~1 < 10); 2091#L29 assume !(rangesum_~i~1 > 5); 2075#L28-2 [2021-08-27 17:34:48,571 INFO L793 eck$LassoCheckResult]: Loop: 2075#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2072#L28-3 assume !!(rangesum_~i~1 < 10); 2073#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2075#L28-2 [2021-08-27 17:34:48,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:48,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1594065280, now seen corresponding path program 3 times [2021-08-27 17:34:48,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:48,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322200880] [2021-08-27 17:34:48,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:48,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:48,578 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:48,586 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:48,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:48,586 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 15 times [2021-08-27 17:34:48,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:48,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374692672] [2021-08-27 17:34:48,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:48,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:48,589 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:48,590 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:48,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:48,590 INFO L82 PathProgramCache]: Analyzing trace with hash -654604830, now seen corresponding path program 4 times [2021-08-27 17:34:48,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:48,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974883735] [2021-08-27 17:34:48,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:48,590 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:34:48,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:48,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974883735] [2021-08-27 17:34:48,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974883735] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:48,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749775405] [2021-08-27 17:34:48,624 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 17:34:48,624 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:48,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:48,632 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:48,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-08-27 17:34:48,752 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 17:34:48,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:48,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:34:48,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:34:48,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749775405] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:48,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:48,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 17:34:48,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965360730] [2021-08-27 17:34:48,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:48,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 17:34:48,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 17:34:48,914 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. cyclomatic complexity: 14 Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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) [2021-08-27 17:34:48,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:48,984 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2021-08-27 17:34:48,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:34:48,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 94 transitions. [2021-08-27 17:34:48,985 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:48,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 94 transitions. [2021-08-27 17:34:48,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2021-08-27 17:34:48,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2021-08-27 17:34:48,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 94 transitions. [2021-08-27 17:34:48,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:48,986 INFO L681 BuchiCegarLoop]: Abstraction has 85 states and 94 transitions. [2021-08-27 17:34:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 94 transitions. [2021-08-27 17:34:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2021-08-27 17:34:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.1097560975609757) internal successors, (91), 81 states have internal predecessors, (91), 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) [2021-08-27 17:34:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2021-08-27 17:34:48,987 INFO L704 BuchiCegarLoop]: Abstraction has 82 states and 91 transitions. [2021-08-27 17:34:48,987 INFO L587 BuchiCegarLoop]: Abstraction has 82 states and 91 transitions. [2021-08-27 17:34:48,987 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-08-27 17:34:48,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 91 transitions. [2021-08-27 17:34:48,988 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:48,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:48,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:48,988 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 4, 1, 1, 1, 1] [2021-08-27 17:34:48,989 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:48,989 INFO L791 eck$LassoCheckResult]: Stem: 2322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 2323#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2335#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2336#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2337#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2338#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2373#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2372#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2371#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2370#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2369#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2368#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2367#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2366#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2365#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2364#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2363#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2362#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2361#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2360#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2359#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2352#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2351#L17-3 assume !(init_nondet_~i~0 < 10); 2328#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2329#L28-3 assume !!(rangesum_~i~1 < 10); 2383#L29 assume !(rangesum_~i~1 > 5); 2333#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2334#L28-3 assume !!(rangesum_~i~1 < 10); 2330#L29 assume !(rangesum_~i~1 > 5); 2331#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2381#L28-3 assume !!(rangesum_~i~1 < 10); 2380#L29 assume !(rangesum_~i~1 > 5); 2379#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2378#L28-3 assume !!(rangesum_~i~1 < 10); 2377#L29 assume !(rangesum_~i~1 > 5); 2376#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2375#L28-3 assume !!(rangesum_~i~1 < 10); 2374#L29 assume !(rangesum_~i~1 > 5); 2358#L28-2 [2021-08-27 17:34:48,989 INFO L793 eck$LassoCheckResult]: Loop: 2358#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2355#L28-3 assume !!(rangesum_~i~1 < 10); 2356#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2358#L28-2 [2021-08-27 17:34:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:48,989 INFO L82 PathProgramCache]: Analyzing trace with hash -654604828, now seen corresponding path program 4 times [2021-08-27 17:34:48,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:48,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115463813] [2021-08-27 17:34:48,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:48,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:48,996 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:49,004 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:49,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:49,005 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 16 times [2021-08-27 17:34:49,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:49,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258304973] [2021-08-27 17:34:49,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:49,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:49,007 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:49,008 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:49,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:49,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2114090750, now seen corresponding path program 5 times [2021-08-27 17:34:49,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:49,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564215150] [2021-08-27 17:34:49,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:49,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:49,052 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:34:49,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:49,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564215150] [2021-08-27 17:34:49,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564215150] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:49,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779326070] [2021-08-27 17:34:49,053 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 17:34:49,053 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:49,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:49,054 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:49,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-08-27 17:34:49,213 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-08-27 17:34:49,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:34:49,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 17:34:49,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 17:34:49,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779326070] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:49,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:34:49,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-08-27 17:34:49,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727519578] [2021-08-27 17:34:49,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:49,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 17:34:49,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-27 17:34:49,353 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. cyclomatic complexity: 14 Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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) [2021-08-27 17:34:49,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:49,423 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2021-08-27 17:34:49,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 17:34:49,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 103 transitions. [2021-08-27 17:34:49,424 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-27 17:34:49,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 103 transitions. [2021-08-27 17:34:49,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2021-08-27 17:34:49,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2021-08-27 17:34:49,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 103 transitions. [2021-08-27 17:34:49,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:34:49,425 INFO L681 BuchiCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-08-27 17:34:49,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 103 transitions. [2021-08-27 17:34:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2021-08-27 17:34:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.098901098901099) internal successors, (100), 90 states have internal predecessors, (100), 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) [2021-08-27 17:34:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2021-08-27 17:34:49,426 INFO L704 BuchiCegarLoop]: Abstraction has 91 states and 100 transitions. [2021-08-27 17:34:49,426 INFO L587 BuchiCegarLoop]: Abstraction has 91 states and 100 transitions. [2021-08-27 17:34:49,426 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-08-27 17:34:49,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 100 transitions. [2021-08-27 17:34:49,427 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:49,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:49,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:49,427 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 5, 1, 1, 1, 1] [2021-08-27 17:34:49,427 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:49,427 INFO L791 eck$LassoCheckResult]: Stem: 2632#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 2633#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2645#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2646#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2647#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2648#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2682#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2681#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2680#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2679#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2678#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2677#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2676#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2675#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2674#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2673#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2672#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2671#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2670#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2667#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2662#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2661#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2660#L17-3 assume !(init_nondet_~i~0 < 10); 2638#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2639#L28-3 assume !!(rangesum_~i~1 < 10); 2706#L29 assume !(rangesum_~i~1 > 5); 2642#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2643#L28-3 assume !!(rangesum_~i~1 < 10); 2640#L29 assume !(rangesum_~i~1 > 5); 2641#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2705#L28-3 assume !!(rangesum_~i~1 < 10); 2704#L29 assume !(rangesum_~i~1 > 5); 2703#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2702#L28-3 assume !!(rangesum_~i~1 < 10); 2701#L29 assume !(rangesum_~i~1 > 5); 2700#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2699#L28-3 assume !!(rangesum_~i~1 < 10); 2698#L29 assume !(rangesum_~i~1 > 5); 2697#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2696#L28-3 assume !!(rangesum_~i~1 < 10); 2695#L29 assume !(rangesum_~i~1 > 5); 2669#L28-2 [2021-08-27 17:34:49,427 INFO L793 eck$LassoCheckResult]: Loop: 2669#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2665#L28-3 assume !!(rangesum_~i~1 < 10); 2666#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2669#L28-2 [2021-08-27 17:34:49,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:49,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2114090752, now seen corresponding path program 5 times [2021-08-27 17:34:49,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:49,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203894282] [2021-08-27 17:34:49,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:49,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:49,454 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:49,464 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:49,464 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 17 times [2021-08-27 17:34:49,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:49,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857103422] [2021-08-27 17:34:49,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:49,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:49,468 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:49,469 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:49,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:49,470 INFO L82 PathProgramCache]: Analyzing trace with hash -522805150, now seen corresponding path program 6 times [2021-08-27 17:34:49,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:49,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340779836] [2021-08-27 17:34:49,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:49,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:49,483 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:49,512 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:55,162 WARN L207 SmtUtils]: Spent 5.60 s on a formula simplification. DAG size of input: 296 DAG size of output: 212 [2021-08-27 17:34:55,943 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:34:55,943 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:34:55,943 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:34:55,943 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:34:55,943 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:34:55,943 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:55,944 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:34:55,944 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:34:55,944 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration18_Lasso [2021-08-27 17:34:55,944 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:34:55,944 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:34:55,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:56,653 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:34:56,654 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:34:56,654 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:56,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:56,668 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) [2021-08-27 17:34:56,669 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 [2021-08-27 17:34:56,670 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 [2021-08-27 17:34:56,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:56,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:56,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:56,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:56,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:56,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:56,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:56,713 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 [2021-08-27 17:34:56,713 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:56,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:56,716 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) [2021-08-27 17:34:56,716 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 [2021-08-27 17:34:56,717 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 [2021-08-27 17:34:56,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:56,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:56,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:56,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:56,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:56,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:56,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:56,767 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 [2021-08-27 17:34:56,768 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:56,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:56,768 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) [2021-08-27 17:34:56,770 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 [2021-08-27 17:34:56,771 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 [2021-08-27 17:34:56,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:56,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:56,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:56,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:56,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:56,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:56,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:56,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:56,824 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:56,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:56,825 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) [2021-08-27 17:34:56,826 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 [2021-08-27 17:34:56,830 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 [2021-08-27 17:34:56,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:56,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:56,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:56,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:56,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:56,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:56,857 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:56,873 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 [2021-08-27 17:34:56,873 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:56,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:56,879 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) [2021-08-27 17:34:56,880 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 [2021-08-27 17:34:56,881 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 [2021-08-27 17:34:56,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:56,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:56,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:56,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:56,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:56,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:56,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:56,905 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 [2021-08-27 17:34:56,906 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:56,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:56,907 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) [2021-08-27 17:34:56,907 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 [2021-08-27 17:34:56,908 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 [2021-08-27 17:34:56,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:56,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:56,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:56,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:56,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:56,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:56,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:56,933 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 [2021-08-27 17:34:56,934 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:56,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:56,935 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) [2021-08-27 17:34:56,938 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 [2021-08-27 17:34:56,938 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 [2021-08-27 17:34:56,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:56,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:56,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:56,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:56,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:56,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:56,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:56,967 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 [2021-08-27 17:34:56,967 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:56,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:56,968 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) [2021-08-27 17:34:56,975 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 [2021-08-27 17:34:56,975 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 [2021-08-27 17:34:56,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:56,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:56,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:56,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:56,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:56,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:56,985 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:57,000 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 [2021-08-27 17:34:57,000 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:57,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:57,013 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:57,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-08-27 17:34:57,029 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 [2021-08-27 17:34:57,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:57,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:57,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:57,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:57,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:57,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:57,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:57,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:57,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:57,062 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:57,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:57,063 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:57,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-08-27 17:34:57,065 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 [2021-08-27 17:34:57,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:57,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:57,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:57,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:57,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:57,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:57,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:34:57,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:57,105 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:57,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:57,106 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:57,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-08-27 17:34:57,108 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 [2021-08-27 17:34:57,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:57,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:57,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:57,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:57,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:34:57,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:34:57,136 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:34:57,169 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2021-08-27 17:34:57,169 INFO L444 ModelExtractionUtils]: 16 out of 34 variables were initially zero. Simplification set additionally 15 variables to zero. [2021-08-27 17:34:57,170 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:57,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:57,170 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:57,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-08-27 17:34:57,172 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:34:57,187 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:34:57,187 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:34:57,187 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 17 Supporting invariants [] [2021-08-27 17:34:57,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:57,231 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2021-08-27 17:34:57,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:57,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:34:57,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:57,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:34:57,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:57,410 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-08-27 17:34:57,410 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 100 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2021-08-27 17:34:57,433 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 100 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 104 states and 116 transitions. Complement of second has 7 states. [2021-08-27 17:34:57,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 17:34:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2021-08-27 17:34:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2021-08-27 17:34:57,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 41 letters. Loop has 3 letters. [2021-08-27 17:34:57,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:34:57,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 44 letters. Loop has 3 letters. [2021-08-27 17:34:57,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:34:57,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 41 letters. Loop has 6 letters. [2021-08-27 17:34:57,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:34:57,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 116 transitions. [2021-08-27 17:34:57,438 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:34:57,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 93 states and 104 transitions. [2021-08-27 17:34:57,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2021-08-27 17:34:57,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-08-27 17:34:57,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 104 transitions. [2021-08-27 17:34:57,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:34:57,438 INFO L681 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2021-08-27 17:34:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 104 transitions. [2021-08-27 17:34:57,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-08-27 17:34:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.118279569892473) internal successors, (104), 92 states have internal predecessors, (104), 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) [2021-08-27 17:34:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2021-08-27 17:34:57,440 INFO L704 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2021-08-27 17:34:57,440 INFO L587 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2021-08-27 17:34:57,440 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-08-27 17:34:57,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 104 transitions. [2021-08-27 17:34:57,440 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:34:57,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:57,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:57,443 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:57,443 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:57,444 INFO L791 eck$LassoCheckResult]: Stem: 3044#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 3045#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 3060#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3061#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3062#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3063#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3070#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3120#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3119#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3118#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3117#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3116#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3115#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3114#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3113#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3112#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3111#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3110#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3109#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3108#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3107#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3077#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3076#L17-3 assume !(init_nondet_~i~0 < 10); 3050#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 3051#L28-3 assume !!(rangesum_~i~1 < 10); 3052#L29 assume !(rangesum_~i~1 > 5); 3053#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3056#L28-3 assume !!(rangesum_~i~1 < 10); 3101#L29 assume !(rangesum_~i~1 > 5); 3057#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3058#L28-3 assume !!(rangesum_~i~1 < 10); 3054#L29 assume !(rangesum_~i~1 > 5); 3055#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3098#L28-3 assume !!(rangesum_~i~1 < 10); 3096#L29 assume !(rangesum_~i~1 > 5); 3094#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3092#L28-3 assume !!(rangesum_~i~1 < 10); 3090#L29 assume !(rangesum_~i~1 > 5); 3088#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3086#L28-3 assume !!(rangesum_~i~1 < 10); 3083#L29 assume !(rangesum_~i~1 > 5); 3078#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3072#L28-3 assume !(rangesum_~i~1 < 10); 3073#L28-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 3066#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 3048#L28-8 assume !!(rangesum_~i~1 < 10); 3049#L29-2 assume !(rangesum_~i~1 > 5); 3064#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3065#L28-8 assume !!(rangesum_~i~1 < 10); 3106#L29-2 assume !(rangesum_~i~1 > 5); 3105#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3104#L28-8 assume !!(rangesum_~i~1 < 10); 3103#L29-2 assume !(rangesum_~i~1 > 5); 3102#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3100#L28-8 assume !!(rangesum_~i~1 < 10); 3099#L29-2 assume !(rangesum_~i~1 > 5); 3097#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3095#L28-8 assume !!(rangesum_~i~1 < 10); 3093#L29-2 assume !(rangesum_~i~1 > 5); 3091#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3089#L28-8 assume !!(rangesum_~i~1 < 10); 3087#L29-2 assume !(rangesum_~i~1 > 5); 3084#L28-7 [2021-08-27 17:34:57,444 INFO L793 eck$LassoCheckResult]: Loop: 3084#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3079#L28-8 assume !!(rangesum_~i~1 < 10); 3080#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 3084#L28-7 [2021-08-27 17:34:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:57,444 INFO L82 PathProgramCache]: Analyzing trace with hash -365260545, now seen corresponding path program 1 times [2021-08-27 17:34:57,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:57,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081921335] [2021-08-27 17:34:57,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:57,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-08-27 17:34:57,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:57,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081921335] [2021-08-27 17:34:57,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081921335] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:34:57,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:34:57,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 17:34:57,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796035616] [2021-08-27 17:34:57,483 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2021-08-27 17:34:57,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:57,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651434801] [2021-08-27 17:34:57,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:57,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:57,486 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:57,488 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:57,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:57,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 17:34:57,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 17:34:57,530 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2021-08-27 17:34:57,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:57,571 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2021-08-27 17:34:57,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:34:57,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 123 transitions. [2021-08-27 17:34:57,572 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-08-27 17:34:57,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 106 states and 119 transitions. [2021-08-27 17:34:57,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2021-08-27 17:34:57,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2021-08-27 17:34:57,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 119 transitions. [2021-08-27 17:34:57,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:34:57,572 INFO L681 BuchiCegarLoop]: Abstraction has 106 states and 119 transitions. [2021-08-27 17:34:57,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 119 transitions. [2021-08-27 17:34:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2021-08-27 17:34:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.0947368421052632) internal successors, (104), 94 states have internal predecessors, (104), 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) [2021-08-27 17:34:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2021-08-27 17:34:57,573 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2021-08-27 17:34:57,573 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2021-08-27 17:34:57,574 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-08-27 17:34:57,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 104 transitions. [2021-08-27 17:34:57,574 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-27 17:34:57,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:57,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:57,574 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:57,574 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:57,575 INFO L791 eck$LassoCheckResult]: Stem: 3252#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 3253#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 3268#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3269#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3270#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3271#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3304#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3303#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3302#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3301#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3300#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3299#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3298#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3297#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3296#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3295#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3294#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3293#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3292#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3291#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3290#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3285#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3284#L17-3 assume !(init_nondet_~i~0 < 10); 3258#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 3259#L28-3 assume !!(rangesum_~i~1 < 10); 3260#L29 assume !(rangesum_~i~1 > 5); 3261#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3264#L28-3 assume !!(rangesum_~i~1 < 10); 3330#L29 assume !(rangesum_~i~1 > 5); 3265#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3266#L28-3 assume !!(rangesum_~i~1 < 10); 3262#L29 assume !(rangesum_~i~1 > 5); 3263#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3329#L28-3 assume !!(rangesum_~i~1 < 10); 3328#L29 assume !(rangesum_~i~1 > 5); 3327#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3326#L28-3 assume !!(rangesum_~i~1 < 10); 3325#L29 assume !(rangesum_~i~1 > 5); 3324#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3323#L28-3 assume !!(rangesum_~i~1 < 10); 3322#L29 assume !(rangesum_~i~1 > 5); 3307#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3321#L28-3 assume !!(rangesum_~i~1 < 10); 3306#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 3286#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3279#L28-3 assume !(rangesum_~i~1 < 10); 3280#L28-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 3273#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 3274#L28-8 assume !!(rangesum_~i~1 < 10); 3283#L29-2 assume !(rangesum_~i~1 > 5); 3272#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3256#L28-8 assume !!(rangesum_~i~1 < 10); 3257#L29-2 assume !(rangesum_~i~1 > 5); 3320#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3319#L28-8 assume !!(rangesum_~i~1 < 10); 3318#L29-2 assume !(rangesum_~i~1 > 5); 3317#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3316#L28-8 assume !!(rangesum_~i~1 < 10); 3315#L29-2 assume !(rangesum_~i~1 > 5); 3314#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3313#L28-8 assume !!(rangesum_~i~1 < 10); 3312#L29-2 assume !(rangesum_~i~1 > 5); 3311#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3310#L28-8 assume !!(rangesum_~i~1 < 10); 3309#L29-2 assume !(rangesum_~i~1 > 5); 3305#L28-7 [2021-08-27 17:34:57,575 INFO L793 eck$LassoCheckResult]: Loop: 3305#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3308#L28-8 assume !!(rangesum_~i~1 < 10); 3288#L29-2 assume !(rangesum_~i~1 > 5); 3305#L28-7 [2021-08-27 17:34:57,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:57,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1039890653, now seen corresponding path program 1 times [2021-08-27 17:34:57,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:57,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301877679] [2021-08-27 17:34:57,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:57,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:57,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2021-08-27 17:34:57,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:57,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301877679] [2021-08-27 17:34:57,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301877679] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:57,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672481158] [2021-08-27 17:34:57,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:57,624 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:57,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:57,624 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:57,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-08-27 17:34:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:57,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 17:34:57,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2021-08-27 17:34:57,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672481158] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:34:57,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 17:34:57,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-08-27 17:34:57,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387468143] [2021-08-27 17:34:57,955 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:57,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:57,955 INFO L82 PathProgramCache]: Analyzing trace with hash 85180, now seen corresponding path program 1 times [2021-08-27 17:34:57,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:57,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295009514] [2021-08-27 17:34:57,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:57,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:57,957 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:57,958 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:57,970 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:34:57,970 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:34:57,970 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:34:57,970 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:34:57,970 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 17:34:57,970 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:57,970 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:34:57,970 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:34:57,970 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration20_Loop [2021-08-27 17:34:57,970 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:34:57,970 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:34:57,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:57,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:57,997 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:34:57,997 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 17:34:57,998 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:57,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:58,000 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:34:58,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-08-27 17:34:58,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 17:34:58,001 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 17:34:58,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:58,030 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:58,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:58,031 INFO L229 MonitoredProcess]: Starting monitored process 39 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) [2021-08-27 17:34:58,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-08-27 17:34:58,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 17:34:58,033 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 17:34:58,104 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 17:34:58,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:58,107 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:34:58,108 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:34:58,108 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:34:58,108 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:34:58,108 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:34:58,108 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:58,108 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:34:58,108 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:34:58,108 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration20_Loop [2021-08-27 17:34:58,108 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:34:58,108 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:34:58,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:34:58,132 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:34:58,132 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:34:58,132 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:58,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:58,133 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2021-08-27 17:34:58,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-08-27 17:34:58,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:34:58,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:34:58,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:34:58,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:34:58,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:34:58,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:34:58,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:34:58,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:34:58,151 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:34:58,152 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 17:34:58,152 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 17:34:58,152 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:34:58,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:58,154 INFO L229 MonitoredProcess]: Starting monitored process 41 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) [2021-08-27 17:34:58,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-08-27 17:34:58,155 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:34:58,155 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 17:34:58,155 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:34:58,155 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 9 Supporting invariants [] [2021-08-27 17:34:58,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:58,171 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 17:34:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:58,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:34:58,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:58,354 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:34:58,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:34:58,381 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 17:34:58,381 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 104 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2021-08-27 17:34:58,402 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 104 transitions. cyclomatic complexity: 14. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 114 states and 126 transitions. Complement of second has 5 states. [2021-08-27 17:34:58,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 17:34:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2021-08-27 17:34:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2021-08-27 17:34:58,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 65 letters. Loop has 3 letters. [2021-08-27 17:34:58,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:34:58,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 68 letters. Loop has 3 letters. [2021-08-27 17:34:58,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:34:58,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 65 letters. Loop has 6 letters. [2021-08-27 17:34:58,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:34:58,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2021-08-27 17:34:58,405 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:34:58,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 99 states and 109 transitions. [2021-08-27 17:34:58,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-08-27 17:34:58,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2021-08-27 17:34:58,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 109 transitions. [2021-08-27 17:34:58,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:34:58,406 INFO L681 BuchiCegarLoop]: Abstraction has 99 states and 109 transitions. [2021-08-27 17:34:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 109 transitions. [2021-08-27 17:34:58,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-08-27 17:34:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.1020408163265305) internal successors, (108), 97 states have internal predecessors, (108), 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) [2021-08-27 17:34:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2021-08-27 17:34:58,408 INFO L704 BuchiCegarLoop]: Abstraction has 98 states and 108 transitions. [2021-08-27 17:34:58,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:58,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 17:34:58,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:34:58,408 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2021-08-27 17:34:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:58,425 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2021-08-27 17:34:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:34:58,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 122 transitions. [2021-08-27 17:34:58,426 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-27 17:34:58,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 109 states and 122 transitions. [2021-08-27 17:34:58,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2021-08-27 17:34:58,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2021-08-27 17:34:58,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 122 transitions. [2021-08-27 17:34:58,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:34:58,427 INFO L681 BuchiCegarLoop]: Abstraction has 109 states and 122 transitions. [2021-08-27 17:34:58,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 122 transitions. [2021-08-27 17:34:58,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2021-08-27 17:34:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.0816326530612246) internal successors, (106), 97 states have internal predecessors, (106), 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) [2021-08-27 17:34:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-08-27 17:34:58,428 INFO L704 BuchiCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-08-27 17:34:58,428 INFO L587 BuchiCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-08-27 17:34:58,429 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-08-27 17:34:58,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 106 transitions. [2021-08-27 17:34:58,429 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:34:58,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:58,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:58,430 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:58,430 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:58,430 INFO L791 eck$LassoCheckResult]: Stem: 4086#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 4087#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 4103#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4104#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4105#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4106#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4143#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4142#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4141#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4140#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4139#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4138#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4137#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4136#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4135#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4134#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4133#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4132#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4129#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4127#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4126#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4123#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4122#L17-3 assume !(init_nondet_~i~0 < 10); 4094#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4095#L28-3 assume !!(rangesum_~i~1 < 10); 4096#L29 assume !(rangesum_~i~1 > 5); 4097#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4100#L28-3 assume !!(rangesum_~i~1 < 10); 4098#L29 assume !(rangesum_~i~1 > 5); 4099#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4101#L28-3 assume !!(rangesum_~i~1 < 10); 4118#L29 assume !(rangesum_~i~1 > 5); 4156#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4155#L28-3 assume !!(rangesum_~i~1 < 10); 4154#L29 assume !(rangesum_~i~1 > 5); 4153#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4152#L28-3 assume !!(rangesum_~i~1 < 10); 4151#L29 assume !(rangesum_~i~1 > 5); 4150#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4149#L28-3 assume !!(rangesum_~i~1 < 10); 4148#L29 assume !(rangesum_~i~1 > 5); 4131#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4147#L28-3 assume !!(rangesum_~i~1 < 10); 4130#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4128#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4116#L28-3 assume !(rangesum_~i~1 < 10); 4117#L28-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 4110#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4111#L28-8 assume !!(rangesum_~i~1 < 10); 4121#L29-2 assume !(rangesum_~i~1 > 5); 4107#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4092#L28-8 assume !!(rangesum_~i~1 < 10); 4093#L29-2 assume !(rangesum_~i~1 > 5); 4108#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4109#L28-8 assume !!(rangesum_~i~1 < 10); 4167#L29-2 assume !(rangesum_~i~1 > 5); 4166#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4165#L28-8 assume !!(rangesum_~i~1 < 10); 4164#L29-2 assume !(rangesum_~i~1 > 5); 4163#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4162#L28-8 assume !!(rangesum_~i~1 < 10); 4159#L29-2 assume !(rangesum_~i~1 > 5); 4160#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4161#L28-8 assume !!(rangesum_~i~1 < 10); 4146#L29-2 assume !(rangesum_~i~1 > 5); 4144#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4090#L28-8 assume !!(rangesum_~i~1 < 10); 4091#L29-2 [2021-08-27 17:34:58,430 INFO L793 eck$LassoCheckResult]: Loop: 4091#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4125#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4124#L28-8 assume !!(rangesum_~i~1 < 10); 4091#L29-2 [2021-08-27 17:34:58,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:58,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1815162476, now seen corresponding path program 1 times [2021-08-27 17:34:58,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:58,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180058657] [2021-08-27 17:34:58,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:58,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:58,438 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 17:34:58,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1537569514] [2021-08-27 17:34:58,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:58,438 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:58,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:58,446 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:58,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-08-27 17:34:58,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-08-27 17:34:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:58,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 17:34:58,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2021-08-27 17:34:58,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:58,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180058657] [2021-08-27 17:34:58,848 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-27 17:34:58,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537569514] [2021-08-27 17:34:58,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537569514] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:58,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 17:34:58,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2021-08-27 17:34:58,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919581293] [2021-08-27 17:34:58,848 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:58,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:58,848 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 2 times [2021-08-27 17:34:58,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:58,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117986326] [2021-08-27 17:34:58,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:58,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:58,851 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:58,852 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:58,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:58,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 17:34:58,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-27 17:34:58,901 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. cyclomatic complexity: 14 Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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) [2021-08-27 17:34:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:59,009 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2021-08-27 17:34:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 17:34:59,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 141 transitions. [2021-08-27 17:34:59,010 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2021-08-27 17:34:59,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 124 states and 139 transitions. [2021-08-27 17:34:59,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-08-27 17:34:59,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-08-27 17:34:59,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 139 transitions. [2021-08-27 17:34:59,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:34:59,012 INFO L681 BuchiCegarLoop]: Abstraction has 124 states and 139 transitions. [2021-08-27 17:34:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 139 transitions. [2021-08-27 17:34:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 104. [2021-08-27 17:34:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.0865384615384615) internal successors, (113), 103 states have internal predecessors, (113), 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) [2021-08-27 17:34:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2021-08-27 17:34:59,014 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 113 transitions. [2021-08-27 17:34:59,014 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 113 transitions. [2021-08-27 17:34:59,014 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-08-27 17:34:59,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 113 transitions. [2021-08-27 17:34:59,015 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:34:59,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:59,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:59,015 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:59,015 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:59,015 INFO L791 eck$LassoCheckResult]: Stem: 4521#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 4522#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 4539#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4540#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4541#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4542#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4580#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4579#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4578#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4577#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4576#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4575#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4574#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4573#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4572#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4571#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4570#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4569#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4568#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4567#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4566#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4561#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4560#L17-3 assume !(init_nondet_~i~0 < 10); 4529#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4530#L28-3 assume !!(rangesum_~i~1 < 10); 4531#L29 assume !(rangesum_~i~1 > 5); 4532#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4535#L28-3 assume !!(rangesum_~i~1 < 10); 4554#L29 assume !(rangesum_~i~1 > 5); 4536#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4537#L28-3 assume !!(rangesum_~i~1 < 10); 4533#L29 assume !(rangesum_~i~1 > 5); 4534#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4599#L28-3 assume !!(rangesum_~i~1 < 10); 4598#L29 assume !(rangesum_~i~1 > 5); 4597#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4596#L28-3 assume !!(rangesum_~i~1 < 10); 4595#L29 assume !(rangesum_~i~1 > 5); 4594#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4593#L28-3 assume !!(rangesum_~i~1 < 10); 4592#L29 assume !(rangesum_~i~1 > 5); 4585#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4591#L28-3 assume !!(rangesum_~i~1 < 10); 4590#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4584#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4589#L28-3 assume !!(rangesum_~i~1 < 10); 4583#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4565#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4552#L28-3 assume !(rangesum_~i~1 < 10); 4553#L28-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 4546#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4547#L28-8 assume !!(rangesum_~i~1 < 10); 4557#L29-2 assume !(rangesum_~i~1 > 5); 4543#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4544#L28-8 assume !!(rangesum_~i~1 < 10); 4607#L29-2 assume !(rangesum_~i~1 > 5); 4545#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4527#L28-8 assume !!(rangesum_~i~1 < 10); 4528#L29-2 assume !(rangesum_~i~1 > 5); 4602#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4606#L28-8 assume !!(rangesum_~i~1 < 10); 4605#L29-2 assume !(rangesum_~i~1 > 5); 4604#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4603#L28-8 assume !!(rangesum_~i~1 < 10); 4558#L29-2 assume !(rangesum_~i~1 > 5); 4559#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4608#L28-8 assume !!(rangesum_~i~1 < 10); 4588#L29-2 assume !(rangesum_~i~1 > 5); 4586#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4525#L28-8 assume !!(rangesum_~i~1 < 10); 4526#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4582#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4581#L28-8 assume !!(rangesum_~i~1 < 10); 4563#L29-2 [2021-08-27 17:34:59,015 INFO L793 eck$LassoCheckResult]: Loop: 4563#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4564#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4562#L28-8 assume !!(rangesum_~i~1 < 10); 4563#L29-2 [2021-08-27 17:34:59,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:59,016 INFO L82 PathProgramCache]: Analyzing trace with hash 2012858871, now seen corresponding path program 1 times [2021-08-27 17:34:59,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:59,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463434477] [2021-08-27 17:34:59,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:59,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:59,024 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 17:34:59,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1255933611] [2021-08-27 17:34:59,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:59,025 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:59,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:59,033 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:59,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-08-27 17:34:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:34:59,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 17:34:59,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:34:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2021-08-27 17:34:59,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:34:59,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463434477] [2021-08-27 17:34:59,505 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-27 17:34:59,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255933611] [2021-08-27 17:34:59,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255933611] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:34:59,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 17:34:59,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-08-27 17:34:59,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585215970] [2021-08-27 17:34:59,506 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:34:59,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:59,506 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 3 times [2021-08-27 17:34:59,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:59,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673922511] [2021-08-27 17:34:59,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:59,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:59,509 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:34:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:34:59,511 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:34:59,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:34:59,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 17:34:59,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-08-27 17:34:59,555 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. cyclomatic complexity: 15 Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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) [2021-08-27 17:34:59,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:34:59,697 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2021-08-27 17:34:59,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 17:34:59,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 156 transitions. [2021-08-27 17:34:59,698 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2021-08-27 17:34:59,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 136 states and 154 transitions. [2021-08-27 17:34:59,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2021-08-27 17:34:59,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2021-08-27 17:34:59,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 154 transitions. [2021-08-27 17:34:59,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:34:59,698 INFO L681 BuchiCegarLoop]: Abstraction has 136 states and 154 transitions. [2021-08-27 17:34:59,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 154 transitions. [2021-08-27 17:34:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2021-08-27 17:34:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.0909090909090908) internal successors, (120), 109 states have internal predecessors, (120), 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) [2021-08-27 17:34:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-08-27 17:34:59,700 INFO L704 BuchiCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-08-27 17:34:59,700 INFO L587 BuchiCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-08-27 17:34:59,700 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-08-27 17:34:59,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 120 transitions. [2021-08-27 17:34:59,700 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:34:59,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:34:59,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:34:59,701 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 8, 6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:34:59,701 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:34:59,701 INFO L791 eck$LassoCheckResult]: Stem: 4993#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 4994#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 5012#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5013#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5014#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5015#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5052#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5051#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5050#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5049#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5048#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5047#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5046#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5045#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5044#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5043#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5042#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5041#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5040#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5039#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5038#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5033#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5032#L17-3 assume !(init_nondet_~i~0 < 10); 5001#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 5002#L28-3 assume !!(rangesum_~i~1 < 10); 5003#L29 assume !(rangesum_~i~1 > 5); 5004#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5007#L28-3 assume !!(rangesum_~i~1 < 10); 5027#L29 assume !(rangesum_~i~1 > 5); 5008#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5009#L28-3 assume !!(rangesum_~i~1 < 10); 5005#L29 assume !(rangesum_~i~1 > 5); 5006#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5078#L28-3 assume !!(rangesum_~i~1 < 10); 5077#L29 assume !(rangesum_~i~1 > 5); 5076#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5075#L28-3 assume !!(rangesum_~i~1 < 10); 5074#L29 assume !(rangesum_~i~1 > 5); 5073#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5072#L28-3 assume !!(rangesum_~i~1 < 10); 5071#L29 assume !(rangesum_~i~1 > 5); 5055#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5070#L28-3 assume !!(rangesum_~i~1 < 10); 5069#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5068#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5067#L28-3 assume !!(rangesum_~i~1 < 10); 5066#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5054#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5058#L28-3 assume !!(rangesum_~i~1 < 10); 5053#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5037#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5025#L28-3 assume !(rangesum_~i~1 < 10); 5026#L28-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 5019#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4997#L28-8 assume !!(rangesum_~i~1 < 10); 4998#L29-2 assume !(rangesum_~i~1 > 5); 5016#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5017#L28-8 assume !!(rangesum_~i~1 < 10); 5082#L29-2 assume !(rangesum_~i~1 > 5); 5081#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5079#L28-8 assume !!(rangesum_~i~1 < 10); 5080#L29-2 assume !(rangesum_~i~1 > 5); 5087#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5086#L28-8 assume !!(rangesum_~i~1 < 10); 5085#L29-2 assume !(rangesum_~i~1 > 5); 5084#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5083#L28-8 assume !!(rangesum_~i~1 < 10); 5030#L29-2 assume !(rangesum_~i~1 > 5); 5031#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5088#L28-8 assume !!(rangesum_~i~1 < 10); 5065#L29-2 assume !(rangesum_~i~1 > 5); 5064#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5063#L28-8 assume !!(rangesum_~i~1 < 10); 5061#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5062#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5060#L28-8 assume !!(rangesum_~i~1 < 10); 5059#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5057#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5056#L28-8 assume !!(rangesum_~i~1 < 10); 5035#L29-2 [2021-08-27 17:34:59,701 INFO L793 eck$LassoCheckResult]: Loop: 5035#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5036#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5034#L28-8 assume !!(rangesum_~i~1 < 10); 5035#L29-2 [2021-08-27 17:34:59,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:34:59,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1646097460, now seen corresponding path program 2 times [2021-08-27 17:34:59,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:34:59,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524351351] [2021-08-27 17:34:59,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:34:59,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:34:59,717 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 17:34:59,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255364038] [2021-08-27 17:34:59,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:34:59,717 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:34:59,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:34:59,718 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:34:59,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-08-27 17:35:00,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:35:00,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:35:00,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 17:35:00,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2021-08-27 17:35:00,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:35:00,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524351351] [2021-08-27 17:35:00,247 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-27 17:35:00,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255364038] [2021-08-27 17:35:00,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255364038] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:35:00,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-27 17:35:00,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-08-27 17:35:00,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891024428] [2021-08-27 17:35:00,247 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:35:00,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:00,248 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 4 times [2021-08-27 17:35:00,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:00,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774734623] [2021-08-27 17:35:00,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:00,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:00,251 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:00,252 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:00,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:35:00,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 17:35:00,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-08-27 17:35:00,296 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. cyclomatic complexity: 16 Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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) [2021-08-27 17:35:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:35:00,439 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2021-08-27 17:35:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 17:35:00,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 158 transitions. [2021-08-27 17:35:00,441 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2021-08-27 17:35:00,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 156 transitions. [2021-08-27 17:35:00,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2021-08-27 17:35:00,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2021-08-27 17:35:00,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 156 transitions. [2021-08-27 17:35:00,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:35:00,442 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 156 transitions. [2021-08-27 17:35:00,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 156 transitions. [2021-08-27 17:35:00,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2021-08-27 17:35:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 115 states have internal predecessors, (127), 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) [2021-08-27 17:35:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2021-08-27 17:35:00,444 INFO L704 BuchiCegarLoop]: Abstraction has 116 states and 127 transitions. [2021-08-27 17:35:00,444 INFO L587 BuchiCegarLoop]: Abstraction has 116 states and 127 transitions. [2021-08-27 17:35:00,444 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-08-27 17:35:00,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 127 transitions. [2021-08-27 17:35:00,445 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-27 17:35:00,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:00,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:00,446 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:35:00,446 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:35:00,446 INFO L791 eck$LassoCheckResult]: Stem: 5493#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 5494#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 5515#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5516#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5517#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5518#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5568#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5567#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5566#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5565#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5564#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5562#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5560#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5558#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5556#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5554#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5552#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5550#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5548#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5546#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5544#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5541#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5540#L17-3 assume !(init_nondet_~i~0 < 10); 5505#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 5506#L28-3 assume !!(rangesum_~i~1 < 10); 5501#L29 assume !(rangesum_~i~1 > 5); 5502#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5507#L28-3 assume !!(rangesum_~i~1 < 10); 5527#L29 assume !(rangesum_~i~1 > 5); 5508#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5509#L28-3 assume !!(rangesum_~i~1 < 10); 5503#L29 assume !(rangesum_~i~1 > 5); 5504#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5584#L28-3 assume !!(rangesum_~i~1 < 10); 5583#L29 assume !(rangesum_~i~1 > 5); 5582#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5581#L28-3 assume !!(rangesum_~i~1 < 10); 5580#L29 assume !(rangesum_~i~1 > 5); 5579#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5578#L28-3 assume !!(rangesum_~i~1 < 10); 5577#L29 assume !(rangesum_~i~1 > 5); 5537#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5576#L28-3 assume !!(rangesum_~i~1 < 10); 5575#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5574#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5573#L28-3 assume !!(rangesum_~i~1 < 10); 5572#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5571#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5570#L28-3 assume !!(rangesum_~i~1 < 10); 5569#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5536#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5539#L28-3 assume !!(rangesum_~i~1 < 10); 5535#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5532#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5525#L28-3 assume !(rangesum_~i~1 < 10); 5526#L28-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 5519#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 5497#L28-8 assume !!(rangesum_~i~1 < 10); 5498#L29-2 assume !(rangesum_~i~1 > 5); 5512#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5513#L28-8 assume !!(rangesum_~i~1 < 10); 5588#L29-2 assume !(rangesum_~i~1 > 5); 5587#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5585#L28-8 assume !!(rangesum_~i~1 < 10); 5586#L29-2 assume !(rangesum_~i~1 > 5); 5593#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5592#L28-8 assume !!(rangesum_~i~1 < 10); 5591#L29-2 assume !(rangesum_~i~1 > 5); 5590#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5589#L28-8 assume !!(rangesum_~i~1 < 10); 5530#L29-2 assume !(rangesum_~i~1 > 5); 5531#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5594#L28-8 assume !!(rangesum_~i~1 < 10); 5563#L29-2 assume !(rangesum_~i~1 > 5); 5561#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5559#L28-8 assume !!(rangesum_~i~1 < 10); 5557#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5555#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5553#L28-8 assume !!(rangesum_~i~1 < 10); 5551#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5549#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5547#L28-8 assume !!(rangesum_~i~1 < 10); 5545#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5543#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5542#L28-8 assume !!(rangesum_~i~1 < 10); 5534#L29-2 [2021-08-27 17:35:00,446 INFO L793 eck$LassoCheckResult]: Loop: 5534#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5538#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5533#L28-8 assume !!(rangesum_~i~1 < 10); 5534#L29-2 [2021-08-27 17:35:00,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:00,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1484601769, now seen corresponding path program 3 times [2021-08-27 17:35:00,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:00,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806232235] [2021-08-27 17:35:00,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:00,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:00,464 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 17:35:00,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810915805] [2021-08-27 17:35:00,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 17:35:00,465 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:35:00,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,472 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2021-08-27 17:35:00,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-08-27 17:35:00,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-08-27 17:35:00,844 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:00,946 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:00,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:00,947 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 5 times [2021-08-27 17:35:00,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:00,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863646690] [2021-08-27 17:35:00,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:00,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:00,950 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:00,951 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:00,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:00,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1801965686, now seen corresponding path program 4 times [2021-08-27 17:35:00,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:00,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021144148] [2021-08-27 17:35:00,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:00,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:00,959 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 17:35:00,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878434948] [2021-08-27 17:35:00,959 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 17:35:00,959 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:35:00,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:00,965 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:35:00,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2021-08-27 17:35:01,296 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 17:35:01,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:35:01,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:35:01,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:35:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-08-27 17:35:01,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:35:01,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021144148] [2021-08-27 17:35:01,517 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-27 17:35:01,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878434948] [2021-08-27 17:35:01,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878434948] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:35:01,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:35:01,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 17:35:01,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682220827] [2021-08-27 17:35:01,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:35:01,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 17:35:01,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 17:35:01,560 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. cyclomatic complexity: 17 Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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) [2021-08-27 17:35:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:35:01,638 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2021-08-27 17:35:01,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:35:01,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 143 transitions. [2021-08-27 17:35:01,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-08-27 17:35:01,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 115 states and 119 transitions. [2021-08-27 17:35:01,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2021-08-27 17:35:01,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2021-08-27 17:35:01,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 119 transitions. [2021-08-27 17:35:01,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:35:01,641 INFO L681 BuchiCegarLoop]: Abstraction has 115 states and 119 transitions. [2021-08-27 17:35:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 119 transitions. [2021-08-27 17:35:01,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2021-08-27 17:35:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 95 states have internal predecessors, (100), 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) [2021-08-27 17:35:01,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2021-08-27 17:35:01,642 INFO L704 BuchiCegarLoop]: Abstraction has 96 states and 100 transitions. [2021-08-27 17:35:01,642 INFO L587 BuchiCegarLoop]: Abstraction has 96 states and 100 transitions. [2021-08-27 17:35:01,642 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-08-27 17:35:01,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 100 transitions. [2021-08-27 17:35:01,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-08-27 17:35:01,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:35:01,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:35:01,643 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:35:01,643 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:35:01,643 INFO L791 eck$LassoCheckResult]: Stem: 6021#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 6022#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 6038#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6039#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6040#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6041#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6105#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6104#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6103#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6101#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6099#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6097#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6095#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6093#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6091#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6089#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6087#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6085#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6083#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6082#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6080#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6056#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6055#L17-3 assume !(init_nondet_~i~0 < 10); 6029#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 6030#L28-3 assume !!(rangesum_~i~1 < 10); 6031#L29 assume !(rangesum_~i~1 > 5); 6032#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6035#L28-3 assume !!(rangesum_~i~1 < 10); 6033#L29 assume !(rangesum_~i~1 > 5); 6034#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6036#L28-3 assume !!(rangesum_~i~1 < 10); 6102#L29 assume !(rangesum_~i~1 > 5); 6100#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6098#L28-3 assume !!(rangesum_~i~1 < 10); 6096#L29 assume !(rangesum_~i~1 > 5); 6094#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6092#L28-3 assume !!(rangesum_~i~1 < 10); 6090#L29 assume !(rangesum_~i~1 > 5); 6088#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6086#L28-3 assume !!(rangesum_~i~1 < 10); 6084#L29 assume !(rangesum_~i~1 > 5); 6079#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6081#L28-3 assume !!(rangesum_~i~1 < 10); 6078#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6077#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6076#L28-3 assume !!(rangesum_~i~1 < 10); 6075#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6073#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6071#L28-3 assume !!(rangesum_~i~1 < 10); 6069#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6067#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6065#L28-3 assume !!(rangesum_~i~1 < 10); 6063#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6061#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6059#L28-3 assume !(rangesum_~i~1 < 10); 6051#L28-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 6045#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 6046#L28-8 assume !!(rangesum_~i~1 < 10); 6106#L29-2 assume !(rangesum_~i~1 > 5); 6042#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6043#L28-8 assume !!(rangesum_~i~1 < 10); 6116#L29-2 assume !(rangesum_~i~1 > 5); 6044#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6027#L28-8 assume !!(rangesum_~i~1 < 10); 6028#L29-2 assume !(rangesum_~i~1 > 5); 6054#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6115#L28-8 assume !!(rangesum_~i~1 < 10); 6114#L29-2 assume !(rangesum_~i~1 > 5); 6113#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6112#L28-8 assume !!(rangesum_~i~1 < 10); 6111#L29-2 assume !(rangesum_~i~1 > 5); 6110#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6108#L28-8 assume !!(rangesum_~i~1 < 10); 6109#L29-2 assume !(rangesum_~i~1 > 5); 6107#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6025#L28-8 assume !!(rangesum_~i~1 < 10); 6026#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6053#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6074#L28-8 assume !!(rangesum_~i~1 < 10); 6072#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6070#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6068#L28-8 assume !!(rangesum_~i~1 < 10); 6066#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6064#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6062#L28-8 assume !!(rangesum_~i~1 < 10); 6060#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6058#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6057#L28-8 assume !(rangesum_~i~1 < 10); 6050#L28-9 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 6047#L37-1 main_#t~ret10 := rangesum_#res;main_~ret2~0 := main_#t~ret10;havoc main_#t~ret10;call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~2 := 0; 6048#L54-3 [2021-08-27 17:35:01,643 INFO L793 eck$LassoCheckResult]: Loop: 6048#L54-3 assume !!(main_~i~2 < 9);call main_#t~mem13 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem13, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem13; 6049#L54-2 main_#t~post12 := main_~i~2;main_~i~2 := 1 + main_#t~post12;havoc main_#t~post12; 6048#L54-3 [2021-08-27 17:35:01,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:01,644 INFO L82 PathProgramCache]: Analyzing trace with hash 817204024, now seen corresponding path program 1 times [2021-08-27 17:35:01,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:01,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112840392] [2021-08-27 17:35:01,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:01,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:01,657 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 17:35:01,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794486905] [2021-08-27 17:35:01,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:01,657 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:35:01,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:01,660 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:35:01,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-08-27 17:35:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:02,070 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:02,160 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:02,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:02,160 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2021-08-27 17:35:02,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:02,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161394588] [2021-08-27 17:35:02,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:02,160 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:02,163 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:02,164 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:35:02,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:35:02,165 INFO L82 PathProgramCache]: Analyzing trace with hash -645945734, now seen corresponding path program 1 times [2021-08-27 17:35:02,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:35:02,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593579967] [2021-08-27 17:35:02,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:02,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:35:02,172 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-27 17:35:02,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591954902] [2021-08-27 17:35:02,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:35:02,172 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:35:02,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:35:02,173 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:35:02,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2021-08-27 17:35:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:02,579 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:35:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:35:02,726 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:36:00,858 WARN L207 SmtUtils]: Spent 58.06 s on a formula simplification. DAG size of input: 585 DAG size of output: 405 [2021-08-27 17:37:25,852 WARN L207 SmtUtils]: Spent 11.72 s on a formula simplification that was a NOOP. DAG size: 239 [2021-08-27 17:37:25,855 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:37:25,855 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:37:25,855 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:37:25,855 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:37:25,855 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:37:25,855 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:25,855 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:37:25,855 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:37:25,856 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration25_Lasso [2021-08-27 17:37:25,856 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:37:25,856 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:37:25,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:25,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:25,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:25,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:25,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:29,938 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-27 17:37:29,941 INFO L168 Benchmark]: Toolchain (without parser) took 168208.61 ms. Allocated memory was 52.4 MB in the beginning and 276.8 MB in the end (delta: 224.4 MB). Free memory was 29.5 MB in the beginning and 84.2 MB in the end (delta: -54.6 MB). Peak memory consumption was 214.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:29,941 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 52.4 MB. Free memory was 34.7 MB in the beginning and 34.7 MB in the end (delta: 33.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:37:29,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.14 ms. Allocated memory was 52.4 MB in the beginning and 69.2 MB in the end (delta: 16.8 MB). Free memory was 29.2 MB in the beginning and 51.7 MB in the end (delta: -22.5 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:29,942 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.61 ms. Allocated memory is still 69.2 MB. Free memory was 51.6 MB in the beginning and 49.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:29,942 INFO L168 Benchmark]: Boogie Preprocessor took 38.82 ms. Allocated memory is still 69.2 MB. Free memory was 49.7 MB in the beginning and 48.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:37:29,942 INFO L168 Benchmark]: RCFGBuilder took 425.93 ms. Allocated memory is still 69.2 MB. Free memory was 48.2 MB in the beginning and 43.6 MB in the end (delta: 4.6 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:29,942 INFO L168 Benchmark]: BuchiAutomizer took 167455.70 ms. Allocated memory was 69.2 MB in the beginning and 276.8 MB in the end (delta: 207.6 MB). Free memory was 43.6 MB in the beginning and 84.2 MB in the end (delta: -40.5 MB). Peak memory consumption was 211.4 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:29,943 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 52.4 MB. Free memory was 34.7 MB in the beginning and 34.7 MB in the end (delta: 33.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 242.14 ms. Allocated memory was 52.4 MB in the beginning and 69.2 MB in the end (delta: 16.8 MB). Free memory was 29.2 MB in the beginning and 51.7 MB in the end (delta: -22.5 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.61 ms. Allocated memory is still 69.2 MB. Free memory was 51.6 MB in the beginning and 49.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.82 ms. Allocated memory is still 69.2 MB. Free memory was 49.7 MB in the beginning and 48.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 425.93 ms. Allocated memory is still 69.2 MB. Free memory was 48.2 MB in the beginning and 43.6 MB in the end (delta: 4.6 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 167455.70 ms. Allocated memory was 69.2 MB in the beginning and 276.8 MB in the end (delta: 207.6 MB). Free memory was 43.6 MB in the beginning and 84.2 MB in the end (delta: -40.5 MB). Peak memory consumption was 211.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-27 17:37:29,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:30,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:30,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:30,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2021-08-27 17:37:30,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:30,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2021-08-27 17:37:31,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:31,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:31,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:31,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2021-08-27 17:37:31,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:32,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:32,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:32,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:32,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-08-27 17:37:32,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:33,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:33,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:33,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:33,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:33,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:34,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-08-27 17:37:34,559 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forcibly destroying the process [2021-08-27 17:37:34,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...