./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 5fbdf5bf 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-wip.dd.seqcomp-5fbdf5b [2021-08-31 05:18:51,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 05:18:51,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 05:18:51,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 05:18:51,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 05:18:51,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 05:18:51,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 05:18:51,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 05:18:51,875 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 05:18:51,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 05:18:51,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 05:18:51,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 05:18:51,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 05:18:51,878 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 05:18:51,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 05:18:51,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 05:18:51,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 05:18:51,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 05:18:51,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 05:18:51,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 05:18:51,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 05:18:51,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 05:18:51,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 05:18:51,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 05:18:51,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 05:18:51,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 05:18:51,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 05:18:51,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 05:18:51,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 05:18:51,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 05:18:51,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 05:18:51,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 05:18:51,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 05:18:51,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 05:18:51,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 05:18:51,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 05:18:51,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 05:18:51,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 05:18:51,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 05:18:51,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 05:18:51,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 05:18:51,894 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 05:18:51,908 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 05:18:51,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 05:18:51,909 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 05:18:51,909 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 05:18:51,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 05:18:51,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 05:18:51,910 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 05:18:51,910 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 05:18:51,910 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 05:18:51,911 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 05:18:51,911 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 05:18:51,911 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 05:18:51,911 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 05:18:51,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 05:18:51,911 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 05:18:51,912 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 05:18:51,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 05:18:51,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 05:18:51,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 05:18:51,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 05:18:51,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 05:18:51,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 05:18:51,913 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 05:18:51,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 05:18:51,913 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 05:18:51,913 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 05:18:51,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 05:18:51,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 05:18:51,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 05:18:51,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 05:18:51,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 05:18:51,914 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 05:18:51,915 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 05:18:51,915 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-31 05:18:52,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 05:18:52,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 05:18:52,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 05:18:52,199 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 05:18:52,200 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 05:18:52,201 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum10.i [2021-08-31 05:18:52,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abcbd36a2/1c32b667cd5345a6a2292540a4d19f54/FLAGef94cbc12 [2021-08-31 05:18:52,623 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 05:18:52,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i [2021-08-31 05:18:52,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abcbd36a2/1c32b667cd5345a6a2292540a4d19f54/FLAGef94cbc12 [2021-08-31 05:18:53,026 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abcbd36a2/1c32b667cd5345a6a2292540a4d19f54 [2021-08-31 05:18:53,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 05:18:53,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 05:18:53,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 05:18:53,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 05:18:53,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 05:18:53,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 05:18:53" (1/1) ... [2021-08-31 05:18:53,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28137cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:53, skipping insertion in model container [2021-08-31 05:18:53,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 05:18:53" (1/1) ... [2021-08-31 05:18:53,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 05:18:53,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 05:18:53,150 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-31 05:18:53,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 05:18:53,156 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 05:18:53,169 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-31 05:18:53,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 05:18:53,179 INFO L208 MainTranslator]: Completed translation [2021-08-31 05:18:53,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:53 WrapperNode [2021-08-31 05:18:53,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 05:18:53,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 05:18:53,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 05:18:53,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 05:18:53,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:53" (1/1) ... [2021-08-31 05:18:53,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:53" (1/1) ... [2021-08-31 05:18:53,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 05:18:53,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 05:18:53,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 05:18:53,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 05:18:53,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:53" (1/1) ... [2021-08-31 05:18:53,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:53" (1/1) ... [2021-08-31 05:18:53,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:53" (1/1) ... [2021-08-31 05:18:53,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:53" (1/1) ... [2021-08-31 05:18:53,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:53" (1/1) ... [2021-08-31 05:18:53,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:53" (1/1) ... [2021-08-31 05:18:53,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:53" (1/1) ... [2021-08-31 05:18:53,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 05:18:53,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 05:18:53,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 05:18:53,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 05:18:53,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:53" (1/1) ... [2021-08-31 05:18:53,266 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:53,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:53,286 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-31 05:18:53,300 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-31 05:18:53,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 05:18:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 05:18:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-31 05:18:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 05:18:53,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 05:18:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-31 05:18:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-31 05:18:53,545 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 05:18:53,545 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-08-31 05:18:53,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 05:18:53 BoogieIcfgContainer [2021-08-31 05:18:53,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 05:18:53,547 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 05:18:53,547 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 05:18:53,549 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 05:18:53,550 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:18:53,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 05:18:53" (1/3) ... [2021-08-31 05:18:53,551 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44a3576a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 05:18:53, skipping insertion in model container [2021-08-31 05:18:53,551 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:18:53,551 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:18:53" (2/3) ... [2021-08-31 05:18:53,551 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44a3576a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 05:18:53, skipping insertion in model container [2021-08-31 05:18:53,551 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:18:53,552 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 05:18:53" (3/3) ... [2021-08-31 05:18:53,553 INFO L389 chiAutomizerObserver]: Analyzing ICFG rangesum10.i [2021-08-31 05:18:53,581 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 05:18:53,581 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 05:18:53,582 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 05:18:53,582 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 05:18:53,582 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 05:18:53,582 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 05:18:53,582 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 05:18:53,582 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 05:18:53,591 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-31 05:18:53,616 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-08-31 05:18:53,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:53,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:53,621 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:18:53,621 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 05:18:53,621 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 05:18:53,621 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-31 05:18:53,625 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-08-31 05:18:53,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:53,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:53,626 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:18:53,627 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 05:18:53,633 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-31 05:18:53,633 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-31 05:18:53,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:53,641 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-31 05:18:53,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:53,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540269656] [2021-08-31 05:18:53,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:53,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,731 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,782 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:53,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:53,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-31 05:18:53,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:53,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798496154] [2021-08-31 05:18:53,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:53,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,799 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,813 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:53,815 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-31 05:18:53,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:53,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382467077] [2021-08-31 05:18:53,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:53,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,836 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:53,867 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:54,280 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:18:54,280 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:18:54,280 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:18:54,281 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:18:54,281 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:18:54,281 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:54,281 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:18:54,281 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:18:54,282 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration1_Lasso [2021-08-31 05:18:54,282 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:18:54,282 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:18:54,298 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-31 05:18:54,302 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-31 05:18:54,304 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-31 05:18:54,306 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-31 05:18:54,309 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-31 05:18:54,311 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-31 05:18:54,485 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-31 05:18:54,488 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-31 05:18:54,490 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-31 05:18:54,492 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-31 05:18:54,494 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-31 05:18:54,497 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-31 05:18:54,499 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-31 05:18:54,501 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-31 05:18:54,503 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-31 05:18:54,505 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-31 05:18:54,507 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-31 05:18:54,509 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-31 05:18:54,511 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-31 05:18:54,742 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:18:54,744 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:18:54,746 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:54,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:54,747 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-31 05:18:54,748 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-31 05:18:54,751 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-31 05:18:54,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:54,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:54,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:54,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:54,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:54,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:54,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:54,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:54,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:54,799 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:54,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:54,801 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-31 05:18:54,801 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-31 05:18:54,802 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-31 05:18:54,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:54,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:54,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:54,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:54,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:54,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:54,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:54,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:54,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-31 05:18:54,837 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:54,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:54,837 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-31 05:18:54,838 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-31 05:18:54,839 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-31 05:18:54,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:54,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:54,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:54,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:54,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:54,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:54,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:54,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:54,886 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-31 05:18:54,888 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:54,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:54,889 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-31 05:18:54,890 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-31 05:18:54,891 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-31 05:18:54,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:54,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:54,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:54,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:54,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:18:54,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:18:54,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:54,937 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-31 05:18:54,937 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:54,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:54,945 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-31 05:18:54,954 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-31 05:18:54,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:54,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:54,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:54,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:54,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:54,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:54,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:54,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:54,964 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-31 05:18:54,981 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-31 05:18:54,981 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:54,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:54,983 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-31 05:18:54,983 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-31 05:18:54,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-31 05:18:54,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:54,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:18:54,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:54,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:54,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:54,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:18:54,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:18:54,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:55,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-08-31 05:18:55,014 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:55,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:55,016 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-31 05:18:55,017 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-31 05:18:55,018 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-31 05:18:55,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:55,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:55,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:55,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:55,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:18:55,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:18:55,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:18:55,074 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-31 05:18:55,074 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:55,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:55,075 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-31 05:18:55,076 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-31 05:18:55,077 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-31 05:18:55,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:18:55,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:18:55,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:18:55,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:18:55,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:18:55,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:18:55,124 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:18:55,144 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-08-31 05:18:55,144 INFO L444 ModelExtractionUtils]: 4 out of 25 variables were initially zero. Simplification set additionally 18 variables to zero. [2021-08-31 05:18:55,145 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:18:55,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:55,157 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-31 05:18:55,160 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:18:55,168 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-31 05:18:55,173 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:18:55,173 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:18:55,173 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_1, ULTIMATE.start_init_nondet_~i~0) = 19*v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_1 - 8*ULTIMATE.start_init_nondet_~i~0 Supporting invariants [] [2021-08-31 05:18:55,192 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-31 05:18:55,240 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-31 05:18:55,246 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-08-31 05:18:55,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:55,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:18:55,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:55,318 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 05:18:55,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:55,369 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-31 05:18:55,391 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-31 05:18:55,393 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-31 05:18:55,505 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-31 05:18:55,506 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-31 05:18:55,511 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-31 05:18:55,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2021-08-31 05:18:55,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-31 05:18:55,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:18:55,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-31 05:18:55,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:18:55,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-31 05:18:55,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:18:55,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 122 transitions. [2021-08-31 05:18:55,518 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:55,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 22 states and 32 transitions. [2021-08-31 05:18:55,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-31 05:18:55,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-31 05:18:55,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2021-08-31 05:18:55,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:18:55,521 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2021-08-31 05:18:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2021-08-31 05:18:55,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-08-31 05:18:55,536 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-31 05:18:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2021-08-31 05:18:55,544 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2021-08-31 05:18:55,545 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2021-08-31 05:18:55,545 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 05:18:55,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2021-08-31 05:18:55,547 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:55,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:55,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:55,548 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-31 05:18:55,548 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:55,548 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-31 05:18:55,548 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-31 05:18:55,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:55,549 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-08-31 05:18:55,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:55,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615385892] [2021-08-31 05:18:55,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:55,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:55,593 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-31 05:18:55,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:18:55,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615385892] [2021-08-31 05:18:55,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615385892] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:18:55,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:18:55,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 05:18:55,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422979953] [2021-08-31 05:18:55,596 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:18:55,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:55,596 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2021-08-31 05:18:55,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:55,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496435717] [2021-08-31 05:18:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:55,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:55,600 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:55,604 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:55,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:18:55,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 05:18:55,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 05:18:55,655 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-31 05:18:55,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:18:55,723 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2021-08-31 05:18:55,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 05:18:55,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2021-08-31 05:18:55,725 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:55,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 32 transitions. [2021-08-31 05:18:55,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-31 05:18:55,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-31 05:18:55,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2021-08-31 05:18:55,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:18:55,725 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2021-08-31 05:18:55,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2021-08-31 05:18:55,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-08-31 05:18:55,726 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-31 05:18:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2021-08-31 05:18:55,727 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-08-31 05:18:55,727 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-08-31 05:18:55,727 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 05:18:55,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2021-08-31 05:18:55,727 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:55,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:55,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:55,727 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 05:18:55,727 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:55,728 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-31 05:18:55,728 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-31 05:18:55,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:55,728 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-08-31 05:18:55,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:55,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514254791] [2021-08-31 05:18:55,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:55,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:55,747 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-31 05:18:55,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:18:55,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514254791] [2021-08-31 05:18:55,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514254791] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:18:55,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488047741] [2021-08-31 05:18:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:55,748 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:18:55,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:55,762 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-31 05:18:55,808 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-31 05:18:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:55,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-31 05:18:55,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:55,842 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-31 05:18:55,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:18:55,861 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-31 05:18:55,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488047741] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:18:55,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:18:55,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-08-31 05:18:55,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027604093] [2021-08-31 05:18:55,862 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:18:55,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:55,863 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2021-08-31 05:18:55,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:55,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645479227] [2021-08-31 05:18:55,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:55,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:55,866 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:55,870 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:55,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:18:55,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 05:18:55,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-31 05:18:55,911 INFO L87 Difference]: Start difference. First operand 22 states and 31 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-31 05:18:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:18:55,997 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2021-08-31 05:18:55,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 05:18:55,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2021-08-31 05:18:55,999 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:55,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 37 transitions. [2021-08-31 05:18:55,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-31 05:18:55,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-31 05:18:55,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2021-08-31 05:18:56,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:18:56,000 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-31 05:18:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2021-08-31 05:18:56,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-08-31 05:18:56,001 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-31 05:18:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2021-08-31 05:18:56,001 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-31 05:18:56,001 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-31 05:18:56,001 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 05:18:56,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2021-08-31 05:18:56,002 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:56,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:56,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:56,005 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-08-31 05:18:56,005 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:56,005 INFO L791 eck$LassoCheckResult]: Stem: 330#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); 331#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; 343#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; 344#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 345#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; 346#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 357#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; 356#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 355#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; 354#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 353#L17-3 assume !(init_nondet_~i~0 < 10); 337#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; 338#L28-3 [2021-08-31 05:18:56,005 INFO L793 eck$LassoCheckResult]: Loop: 338#L28-3 assume !!(rangesum_~i~1 < 10); 339#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; 340#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 338#L28-3 [2021-08-31 05:18:56,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:56,005 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2021-08-31 05:18:56,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:56,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121394403] [2021-08-31 05:18:56,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:56,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:56,061 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-31 05:18:56,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:18:56,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121394403] [2021-08-31 05:18:56,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121394403] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:18:56,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281174130] [2021-08-31 05:18:56,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-31 05:18:56,062 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:18:56,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:56,063 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-31 05:18:56,063 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-31 05:18:56,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-31 05:18:56,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:18:56,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 05:18:56,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:56,122 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-31 05:18:56,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:18:56,177 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-31 05:18:56,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281174130] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:18:56,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:18:56,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-08-31 05:18:56,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595346942] [2021-08-31 05:18:56,179 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:18:56,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:56,179 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2021-08-31 05:18:56,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:56,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051905450] [2021-08-31 05:18:56,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:56,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:56,183 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:56,186 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:56,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:18:56,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-31 05:18:56,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-08-31 05:18:56,225 INFO L87 Difference]: Start difference. First operand 28 states and 37 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-31 05:18:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:18:56,300 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2021-08-31 05:18:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-31 05:18:56,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2021-08-31 05:18:56,301 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:56,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2021-08-31 05:18:56,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-31 05:18:56,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-31 05:18:56,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2021-08-31 05:18:56,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:18:56,303 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-08-31 05:18:56,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2021-08-31 05:18:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-08-31 05:18:56,304 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-31 05:18:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2021-08-31 05:18:56,305 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-08-31 05:18:56,305 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-08-31 05:18:56,305 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 05:18:56,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2021-08-31 05:18:56,306 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:56,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:56,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:56,307 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2021-08-31 05:18:56,307 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:56,307 INFO L791 eck$LassoCheckResult]: Stem: 480#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); 481#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; 492#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; 493#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 494#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; 495#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 500#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; 519#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 518#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; 517#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 516#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; 515#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 514#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; 513#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 512#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; 511#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 510#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; 509#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 508#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; 507#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 506#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; 505#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 504#L17-3 assume !(init_nondet_~i~0 < 10); 487#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; 488#L28-3 [2021-08-31 05:18:56,307 INFO L793 eck$LassoCheckResult]: Loop: 488#L28-3 assume !!(rangesum_~i~1 < 10); 489#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; 490#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 488#L28-3 [2021-08-31 05:18:56,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:56,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2021-08-31 05:18:56,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:56,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731256583] [2021-08-31 05:18:56,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:56,308 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:56,323 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:56,342 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:56,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:56,343 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2021-08-31 05:18:56,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:56,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418036334] [2021-08-31 05:18:56,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:56,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:56,346 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:56,349 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:56,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:56,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1328180093, now seen corresponding path program 1 times [2021-08-31 05:18:56,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:56,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696282472] [2021-08-31 05:18:56,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:56,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:56,398 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-31 05:18:56,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:18:56,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696282472] [2021-08-31 05:18:56,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696282472] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:18:56,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:18:56,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 05:18:56,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313180747] [2021-08-31 05:18:56,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:18:56,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 05:18:56,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 05:18:56,437 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-31 05:18:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:18:56,479 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2021-08-31 05:18:56,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 05:18:56,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2021-08-31 05:18:56,484 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:56,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 58 transitions. [2021-08-31 05:18:56,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-08-31 05:18:56,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-08-31 05:18:56,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 58 transitions. [2021-08-31 05:18:56,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:18:56,486 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 58 transitions. [2021-08-31 05:18:56,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 58 transitions. [2021-08-31 05:18:56,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2021-08-31 05:18:56,492 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-31 05:18:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2021-08-31 05:18:56,494 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2021-08-31 05:18:56,494 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2021-08-31 05:18:56,494 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 05:18:56,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2021-08-31 05:18:56,494 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:56,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:56,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:56,495 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2021-08-31 05:18:56,495 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:56,495 INFO L791 eck$LassoCheckResult]: Stem: 577#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); 578#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; 590#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; 591#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 592#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; 593#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 622#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; 621#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 620#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; 619#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 618#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; 617#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 616#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);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; 609#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 608#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; 605#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 604#L17-3 assume !(init_nondet_~i~0 < 10); 583#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; 584#L28-3 assume !!(rangesum_~i~1 < 10); 585#L29 assume !(rangesum_~i~1 > 5); 586#L28-2 [2021-08-31 05:18:56,496 INFO L793 eck$LassoCheckResult]: Loop: 586#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 587#L28-3 assume !!(rangesum_~i~1 < 10); 607#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; 586#L28-2 [2021-08-31 05:18:56,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:56,496 INFO L82 PathProgramCache]: Analyzing trace with hash -95702812, now seen corresponding path program 1 times [2021-08-31 05:18:56,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:56,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201351506] [2021-08-31 05:18:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:56,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:56,533 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:56,558 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:56,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:56,558 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 5 times [2021-08-31 05:18:56,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:56,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336258557] [2021-08-31 05:18:56,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:56,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:56,565 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:56,572 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:56,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:56,573 INFO L82 PathProgramCache]: Analyzing trace with hash 775842814, now seen corresponding path program 1 times [2021-08-31 05:18:56,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:56,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893460057] [2021-08-31 05:18:56,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:56,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:56,618 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-31 05:18:56,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:18:56,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893460057] [2021-08-31 05:18:56,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893460057] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:18:56,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254793507] [2021-08-31 05:18:56,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:56,619 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:18:56,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:56,622 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-31 05:18:56,623 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-31 05:18:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:56,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-31 05:18:56,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:56,722 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-31 05:18:56,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:18:56,766 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-31 05:18:56,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254793507] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:18:56,767 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:18:56,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2021-08-31 05:18:56,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963044628] [2021-08-31 05:18:56,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:18:56,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 05:18:56,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-31 05:18:56,817 INFO L87 Difference]: Start difference. First operand 46 states and 55 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-31 05:18:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:18:56,902 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2021-08-31 05:18:56,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 05:18:56,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 85 transitions. [2021-08-31 05:18:56,904 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-31 05:18:56,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 85 transitions. [2021-08-31 05:18:56,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-08-31 05:18:56,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-08-31 05:18:56,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 85 transitions. [2021-08-31 05:18:56,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:18:56,905 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 85 transitions. [2021-08-31 05:18:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 85 transitions. [2021-08-31 05:18:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2021-08-31 05:18:56,907 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-31 05:18:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2021-08-31 05:18:56,907 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 82 transitions. [2021-08-31 05:18:56,907 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 82 transitions. [2021-08-31 05:18:56,907 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 05:18:56,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 82 transitions. [2021-08-31 05:18:56,908 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:56,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:56,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:56,908 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 3, 1, 1, 1, 1] [2021-08-31 05:18:56,909 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:56,909 INFO L791 eck$LassoCheckResult]: Stem: 879#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); 880#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; 892#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; 893#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 894#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; 895#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 929#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; 928#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 927#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; 926#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 925#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; 924#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 923#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; 922#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 921#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; 920#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 919#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; 918#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 917#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; 916#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 915#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; 908#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 907#L17-3 assume !(init_nondet_~i~0 < 10); 885#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; 886#L28-3 assume !!(rangesum_~i~1 < 10); 936#L29 assume !(rangesum_~i~1 > 5); 889#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 890#L28-3 assume !!(rangesum_~i~1 < 10); 887#L29 assume !(rangesum_~i~1 > 5); 888#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 934#L28-3 assume !!(rangesum_~i~1 < 10); 933#L29 assume !(rangesum_~i~1 > 5); 932#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 931#L28-3 assume !!(rangesum_~i~1 < 10); 930#L29 assume !(rangesum_~i~1 > 5); 914#L28-2 [2021-08-31 05:18:56,909 INFO L793 eck$LassoCheckResult]: Loop: 914#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 911#L28-3 assume !!(rangesum_~i~1 < 10); 912#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; 914#L28-2 [2021-08-31 05:18:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:56,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1594065280, now seen corresponding path program 1 times [2021-08-31 05:18:56,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:56,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861687996] [2021-08-31 05:18:56,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:56,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:56,918 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:56,929 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:56,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:56,935 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 6 times [2021-08-31 05:18:56,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:56,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795277386] [2021-08-31 05:18:56,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:56,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:56,938 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:56,940 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:56,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:56,940 INFO L82 PathProgramCache]: Analyzing trace with hash -654604830, now seen corresponding path program 2 times [2021-08-31 05:18:56,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:56,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394735897] [2021-08-31 05:18:56,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:56,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:18:56,972 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-31 05:18:56,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:18:56,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394735897] [2021-08-31 05:18:56,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394735897] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:18:56,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309396636] [2021-08-31 05:18:56,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-31 05:18:56,973 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:18:56,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:18:56,975 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-31 05:18:56,975 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-31 05:18:57,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-31 05:18:57,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:18:57,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 05:18:57,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:18:57,080 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-31 05:18:57,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:18:57,139 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-31 05:18:57,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309396636] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:18:57,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:18:57,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2021-08-31 05:18:57,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551524540] [2021-08-31 05:18:57,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:18:57,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-31 05:18:57,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-31 05:18:57,181 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. cyclomatic complexity: 14 Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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-31 05:18:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:18:57,283 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2021-08-31 05:18:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-31 05:18:57,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 103 transitions. [2021-08-31 05:18:57,287 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-08-31 05:18:57,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 103 transitions. [2021-08-31 05:18:57,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2021-08-31 05:18:57,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2021-08-31 05:18:57,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 103 transitions. [2021-08-31 05:18:57,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:18:57,289 INFO L681 BuchiCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-08-31 05:18:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 103 transitions. [2021-08-31 05:18:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2021-08-31 05:18:57,292 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-31 05:18:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2021-08-31 05:18:57,292 INFO L704 BuchiCegarLoop]: Abstraction has 91 states and 100 transitions. [2021-08-31 05:18:57,292 INFO L587 BuchiCegarLoop]: Abstraction has 91 states and 100 transitions. [2021-08-31 05:18:57,292 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 05:18:57,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 100 transitions. [2021-08-31 05:18:57,293 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:18:57,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:18:57,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:18:57,294 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 5, 1, 1, 1, 1] [2021-08-31 05:18:57,294 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:18:57,294 INFO L791 eck$LassoCheckResult]: Stem: 1282#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); 1283#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; 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; 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; 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; 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; 1332#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; 1331#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1330#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; 1329#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1328#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; 1327#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1326#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; 1325#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1324#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; 1323#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1322#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; 1321#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1320#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; 1319#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1318#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; 1311#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1310#L17-3 assume !(init_nondet_~i~0 < 10); 1288#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; 1289#L28-3 assume !!(rangesum_~i~1 < 10); 1345#L29 assume !(rangesum_~i~1 > 5); 1292#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1293#L28-3 assume !!(rangesum_~i~1 < 10); 1290#L29 assume !(rangesum_~i~1 > 5); 1291#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1343#L28-3 assume !!(rangesum_~i~1 < 10); 1342#L29 assume !(rangesum_~i~1 > 5); 1341#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1340#L28-3 assume !!(rangesum_~i~1 < 10); 1339#L29 assume !(rangesum_~i~1 > 5); 1338#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1337#L28-3 assume !!(rangesum_~i~1 < 10); 1336#L29 assume !(rangesum_~i~1 > 5); 1335#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1334#L28-3 assume !!(rangesum_~i~1 < 10); 1333#L29 assume !(rangesum_~i~1 > 5); 1317#L28-2 [2021-08-31 05:18:57,294 INFO L793 eck$LassoCheckResult]: Loop: 1317#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1314#L28-3 assume !!(rangesum_~i~1 < 10); 1315#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; 1317#L28-2 [2021-08-31 05:18:57,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:57,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2114090752, now seen corresponding path program 2 times [2021-08-31 05:18:57,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:57,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363784949] [2021-08-31 05:18:57,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:57,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:57,307 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:57,330 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:57,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:57,330 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 7 times [2021-08-31 05:18:57,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:57,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715098429] [2021-08-31 05:18:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:57,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:57,333 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:57,334 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:18:57,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:18:57,335 INFO L82 PathProgramCache]: Analyzing trace with hash -522805150, now seen corresponding path program 3 times [2021-08-31 05:18:57,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:18:57,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156734363] [2021-08-31 05:18:57,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:18:57,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:18:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:57,346 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:18:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:18:57,359 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:02,470 WARN L210 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 296 DAG size of output: 212 [2021-08-31 05:19:03,539 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:19:03,539 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:19:03,539 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:19:03,540 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:19:03,540 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:19:03,540 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:03,540 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:19:03,540 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:19:03,540 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration8_Lasso [2021-08-31 05:19:03,540 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:19:03,540 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:19:03,542 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-31 05:19:03,562 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-31 05:19:03,563 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-31 05:19:03,564 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-31 05:19:03,566 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-31 05:19:03,567 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-31 05:19:03,568 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-31 05:19:03,570 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-31 05:19:03,573 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-31 05:19:03,574 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-31 05:19:03,576 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-31 05:19:03,578 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-31 05:19:03,579 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-31 05:19:03,996 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-31 05:19:03,998 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-31 05:19:03,999 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-31 05:19:04,004 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-31 05:19:04,005 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-31 05:19:04,007 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-31 05:19:04,008 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-31 05:19:04,010 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-31 05:19:04,011 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-31 05:19:04,012 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-31 05:19:04,013 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-31 05:19:04,281 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:19:04,282 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:19:04,282 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,286 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:19:04,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-31 05:19:04,287 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-31 05:19:04,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:04,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:04,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:04,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:04,318 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,319 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:19:04,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-31 05:19:04,320 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-31 05:19:04,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:04,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:04,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:04,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:04,344 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,344 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:19:04,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-31 05:19:04,346 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-31 05:19:04,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:04,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:04,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:04,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:04,372 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,372 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:19:04,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-31 05:19:04,374 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-31 05:19:04,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:04,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:04,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:04,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:04,398 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,399 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:19:04,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-31 05:19:04,402 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-31 05:19:04,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:04,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:04,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:04,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-08-31 05:19:04,431 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,431 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:19:04,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-31 05:19:04,438 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-31 05:19:04,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:04,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:04,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:04,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:04,462 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,465 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:19:04,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-31 05:19:04,481 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-31 05:19:04,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,492 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:04,508 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,509 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:19:04,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-31 05:19:04,511 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-31 05:19:04,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:04,540 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,541 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:19:04,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-31 05:19:04,545 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-31 05:19:04,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:04,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:04,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:04,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:04,572 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,572 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:19:04,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-31 05:19:04,574 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-31 05:19:04,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:04,604 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,605 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-31 05:19:04,606 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-31 05:19:04,607 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-31 05:19:04,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:04,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:04,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:04,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,632 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-31 05:19:04,632 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,633 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-31 05:19:04,633 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-31 05:19:04,635 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-31 05:19:04,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-08-31 05:19:04,667 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,667 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-31 05:19:04,668 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-31 05:19:04,669 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-31 05:19:04,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-08-31 05:19:04,700 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,700 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-31 05:19:04,702 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-31 05:19:04,702 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-31 05:19:04,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-08-31 05:19:04,738 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,739 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-31 05:19:04,748 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-31 05:19:04,749 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-31 05:19:04,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-08-31 05:19:04,777 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,778 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-31 05:19:04,778 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-31 05:19:04,779 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-31 05:19:04,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-08-31 05:19:04,804 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,805 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-31 05:19:04,805 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-31 05:19:04,810 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-31 05:19:04,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,845 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-31 05:19:04,845 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,846 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-31 05:19:04,847 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-31 05:19:04,848 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-31 05:19:04,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-08-31 05:19:04,884 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,885 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-31 05:19:04,885 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-31 05:19:04,887 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-31 05:19:04,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-08-31 05:19:04,924 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,925 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-31 05:19:04,926 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-31 05:19:04,927 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-31 05:19:04,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-08-31 05:19:04,972 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,973 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-31 05:19:04,973 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-31 05:19:04,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-31 05:19:04,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:04,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:04,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:04,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,999 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-31 05:19:05,000 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:05,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:05,000 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-31 05:19:05,001 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-31 05:19:05,002 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-31 05:19:05,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:05,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:05,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:05,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:05,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:05,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:05,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:05,031 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-31 05:19:05,031 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:05,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:05,032 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:19:05,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-08-31 05:19:05,034 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-31 05:19:05,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:05,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:05,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:05,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:05,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:05,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:05,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:05,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:05,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:05,065 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:05,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:05,066 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-31 05:19:05,066 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-31 05:19:05,068 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-31 05:19:05,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:05,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:05,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:05,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:05,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:05,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:05,089 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:19:05,119 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2021-08-31 05:19:05,119 INFO L444 ModelExtractionUtils]: 6 out of 34 variables were initially zero. Simplification set additionally 25 variables to zero. [2021-08-31 05:19:05,119 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:05,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:05,120 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-31 05:19:05,120 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-31 05:19:05,121 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:19:05,130 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:19:05,130 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:19:05,130 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-31 05:19:05,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-08-31 05:19:05,176 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2021-08-31 05:19:05,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:05,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:19:05,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:05,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 05:19:05,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:05,288 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-31 05:19:05,289 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-31 05:19:05,289 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-31 05:19:05,318 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-31 05:19:05,319 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-31 05:19:05,319 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-31 05:19:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2021-08-31 05:19:05,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 41 letters. Loop has 3 letters. [2021-08-31 05:19:05,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:19:05,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 44 letters. Loop has 3 letters. [2021-08-31 05:19:05,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:19:05,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 41 letters. Loop has 6 letters. [2021-08-31 05:19:05,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:19:05,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 116 transitions. [2021-08-31 05:19:05,322 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:19:05,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 93 states and 104 transitions. [2021-08-31 05:19:05,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2021-08-31 05:19:05,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-08-31 05:19:05,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 104 transitions. [2021-08-31 05:19:05,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:19:05,324 INFO L681 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2021-08-31 05:19:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 104 transitions. [2021-08-31 05:19:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-08-31 05:19:05,326 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-31 05:19:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2021-08-31 05:19:05,326 INFO L704 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2021-08-31 05:19:05,326 INFO L587 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2021-08-31 05:19:05,326 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 05:19:05,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 104 transitions. [2021-08-31 05:19:05,327 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:19:05,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:05,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:05,328 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:19:05,328 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:19:05,329 INFO L791 eck$LassoCheckResult]: Stem: 1694#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); 1695#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; 1711#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; 1712#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1713#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; 1714#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1770#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; 1769#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1768#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; 1767#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1766#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; 1765#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1764#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; 1763#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1762#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; 1761#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1760#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; 1759#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1758#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; 1757#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1756#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; 1727#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1726#L17-3 assume !(init_nondet_~i~0 < 10); 1700#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; 1701#L28-3 assume !!(rangesum_~i~1 < 10); 1702#L29 assume !(rangesum_~i~1 > 5); 1703#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1707#L28-3 assume !!(rangesum_~i~1 < 10); 1721#L29 assume !(rangesum_~i~1 > 5); 1708#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1709#L28-3 assume !!(rangesum_~i~1 < 10); 1704#L29 assume !(rangesum_~i~1 > 5); 1705#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1751#L28-3 assume !!(rangesum_~i~1 < 10); 1749#L29 assume !(rangesum_~i~1 > 5); 1747#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1745#L28-3 assume !!(rangesum_~i~1 < 10); 1743#L29 assume !(rangesum_~i~1 > 5); 1741#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1739#L28-3 assume !!(rangesum_~i~1 < 10); 1736#L29 assume !(rangesum_~i~1 > 5); 1729#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1728#L28-3 assume !(rangesum_~i~1 < 10); 1724#L28-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1718#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; 1719#L28-8 assume !!(rangesum_~i~1 < 10); 1725#L29-2 assume !(rangesum_~i~1 > 5); 1710#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1698#L28-8 assume !!(rangesum_~i~1 < 10); 1699#L29-2 assume !(rangesum_~i~1 > 5); 1755#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1754#L28-8 assume !!(rangesum_~i~1 < 10); 1753#L29-2 assume !(rangesum_~i~1 > 5); 1752#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1750#L28-8 assume !!(rangesum_~i~1 < 10); 1748#L29-2 assume !(rangesum_~i~1 > 5); 1746#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1744#L28-8 assume !!(rangesum_~i~1 < 10); 1742#L29-2 assume !(rangesum_~i~1 > 5); 1740#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1737#L28-8 assume !!(rangesum_~i~1 < 10); 1733#L29-2 assume !(rangesum_~i~1 > 5); 1732#L28-7 [2021-08-31 05:19:05,329 INFO L793 eck$LassoCheckResult]: Loop: 1732#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1730#L28-8 assume !!(rangesum_~i~1 < 10); 1731#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; 1732#L28-7 [2021-08-31 05:19:05,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:05,329 INFO L82 PathProgramCache]: Analyzing trace with hash -365260545, now seen corresponding path program 1 times [2021-08-31 05:19:05,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:05,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214762655] [2021-08-31 05:19:05,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:05,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:05,381 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-31 05:19:05,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:19:05,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214762655] [2021-08-31 05:19:05,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214762655] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:19:05,382 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:19:05,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 05:19:05,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555023631] [2021-08-31 05:19:05,383 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:19:05,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:05,383 INFO L82 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2021-08-31 05:19:05,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:05,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448512731] [2021-08-31 05:19:05,383 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-31 05:19:05,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:05,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,388 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,390 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:05,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:19:05,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 05:19:05,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-31 05:19:05,429 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-31 05:19:05,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:19:05,487 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2021-08-31 05:19:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 05:19:05,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 123 transitions. [2021-08-31 05:19:05,489 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-08-31 05:19:05,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 106 states and 119 transitions. [2021-08-31 05:19:05,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2021-08-31 05:19:05,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2021-08-31 05:19:05,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 119 transitions. [2021-08-31 05:19:05,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:19:05,490 INFO L681 BuchiCegarLoop]: Abstraction has 106 states and 119 transitions. [2021-08-31 05:19:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 119 transitions. [2021-08-31 05:19:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2021-08-31 05:19:05,498 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-31 05:19:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2021-08-31 05:19:05,499 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2021-08-31 05:19:05,499 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2021-08-31 05:19:05,499 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-31 05:19:05,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 104 transitions. [2021-08-31 05:19:05,500 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-08-31 05:19:05,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:05,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:05,502 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:19:05,502 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:19:05,502 INFO L791 eck$LassoCheckResult]: Stem: 1902#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); 1903#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; 1918#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; 1919#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1920#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; 1921#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1954#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; 1953#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1952#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; 1951#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1950#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; 1949#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1948#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; 1947#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1946#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; 1945#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1944#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; 1943#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1942#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; 1941#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1940#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; 1935#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1934#L17-3 assume !(init_nondet_~i~0 < 10); 1908#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; 1909#L28-3 assume !!(rangesum_~i~1 < 10); 1910#L29 assume !(rangesum_~i~1 > 5); 1911#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1914#L28-3 assume !!(rangesum_~i~1 < 10); 1980#L29 assume !(rangesum_~i~1 > 5); 1915#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1916#L28-3 assume !!(rangesum_~i~1 < 10); 1912#L29 assume !(rangesum_~i~1 > 5); 1913#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1979#L28-3 assume !!(rangesum_~i~1 < 10); 1978#L29 assume !(rangesum_~i~1 > 5); 1977#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1976#L28-3 assume !!(rangesum_~i~1 < 10); 1975#L29 assume !(rangesum_~i~1 > 5); 1974#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1973#L28-3 assume !!(rangesum_~i~1 < 10); 1972#L29 assume !(rangesum_~i~1 > 5); 1957#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1971#L28-3 assume !!(rangesum_~i~1 < 10); 1956#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; 1936#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1929#L28-3 assume !(rangesum_~i~1 < 10); 1930#L28-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1923#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; 1924#L28-8 assume !!(rangesum_~i~1 < 10); 1933#L29-2 assume !(rangesum_~i~1 > 5); 1922#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1906#L28-8 assume !!(rangesum_~i~1 < 10); 1907#L29-2 assume !(rangesum_~i~1 > 5); 1970#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1969#L28-8 assume !!(rangesum_~i~1 < 10); 1968#L29-2 assume !(rangesum_~i~1 > 5); 1967#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1966#L28-8 assume !!(rangesum_~i~1 < 10); 1965#L29-2 assume !(rangesum_~i~1 > 5); 1964#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1963#L28-8 assume !!(rangesum_~i~1 < 10); 1962#L29-2 assume !(rangesum_~i~1 > 5); 1961#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1960#L28-8 assume !!(rangesum_~i~1 < 10); 1959#L29-2 assume !(rangesum_~i~1 > 5); 1955#L28-7 [2021-08-31 05:19:05,502 INFO L793 eck$LassoCheckResult]: Loop: 1955#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1958#L28-8 assume !!(rangesum_~i~1 < 10); 1938#L29-2 assume !(rangesum_~i~1 > 5); 1955#L28-7 [2021-08-31 05:19:05,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:05,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1039890653, now seen corresponding path program 1 times [2021-08-31 05:19:05,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:05,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166927096] [2021-08-31 05:19:05,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:05,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:05,527 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-31 05:19:05,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:19:05,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166927096] [2021-08-31 05:19:05,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166927096] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:19:05,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523434575] [2021-08-31 05:19:05,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:05,528 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:19:05,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:05,529 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:19:05,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-08-31 05:19:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:05,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-31 05:19:05,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:05,691 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-31 05:19:05,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-31 05:19:05,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523434575] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:19:05,692 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-31 05:19:05,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-08-31 05:19:05,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031632303] [2021-08-31 05:19:05,692 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:19:05,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:05,693 INFO L82 PathProgramCache]: Analyzing trace with hash 85180, now seen corresponding path program 1 times [2021-08-31 05:19:05,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:05,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764377068] [2021-08-31 05:19:05,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:05,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,695 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,696 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:05,709 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:19:05,709 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:19:05,709 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:19:05,709 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:19:05,709 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 05:19:05,709 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:05,709 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:19:05,710 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:19:05,710 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration10_Loop [2021-08-31 05:19:05,710 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:19:05,710 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:19:05,710 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-31 05:19:05,712 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-31 05:19:05,727 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:19:05,728 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 05:19:05,729 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:05,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:05,733 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-31 05:19:05,741 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 05:19:05,742 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 05:19:05,751 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-31 05:19:05,757 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 05:19:05,757 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_rangesum_#t~post5=0} Honda state: {ULTIMATE.start_rangesum_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 05:19:05,802 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-31 05:19:05,802 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:05,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:05,803 INFO L229 MonitoredProcess]: Starting monitored process 42 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-31 05:19:05,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-08-31 05:19:05,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 05:19:05,806 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 05:19:05,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:05,830 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:05,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:05,831 INFO L229 MonitoredProcess]: Starting monitored process 43 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-31 05:19:05,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-08-31 05:19:05,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 05:19:05,832 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 05:19:05,899 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 05:19:05,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:05,903 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:19:05,903 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:19:05,903 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:19:05,903 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:19:05,903 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:19:05,903 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:05,903 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:19:05,903 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:19:05,903 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration10_Loop [2021-08-31 05:19:05,903 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:19:05,903 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:19:05,904 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-31 05:19:05,906 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-31 05:19:05,924 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:19:05,924 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:19:05,925 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:05,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:05,929 INFO L229 MonitoredProcess]: Starting monitored process 44 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-31 05:19:05,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:19:05,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-08-31 05:19:05,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:05,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:05,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:05,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:05,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:05,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:05,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:05,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:05,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:05,974 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:05,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:05,975 INFO L229 MonitoredProcess]: Starting monitored process 45 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-31 05:19:05,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-08-31 05:19:05,977 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-31 05:19:05,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:05,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:05,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:05,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:05,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:05,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:05,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:05,986 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:19:05,987 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 05:19:05,987 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 05:19:05,988 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:05,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:05,989 INFO L229 MonitoredProcess]: Starting monitored process 46 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-31 05:19:05,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-08-31 05:19:05,991 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:19:05,991 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 05:19:05,991 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:19:05,991 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-31 05:19:06,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:06,007 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 05:19:06,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:06,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:19:06,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:06,164 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 05:19:06,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:06,174 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-31 05:19:06,175 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-31 05:19:06,175 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-31 05:19:06,230 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-31 05:19:06,230 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-31 05:19:06,231 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-31 05:19:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2021-08-31 05:19:06,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 65 letters. Loop has 3 letters. [2021-08-31 05:19:06,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:19:06,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 68 letters. Loop has 3 letters. [2021-08-31 05:19:06,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:19:06,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 65 letters. Loop has 6 letters. [2021-08-31 05:19:06,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:19:06,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2021-08-31 05:19:06,237 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:19:06,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 99 states and 109 transitions. [2021-08-31 05:19:06,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-08-31 05:19:06,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2021-08-31 05:19:06,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 109 transitions. [2021-08-31 05:19:06,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:19:06,239 INFO L681 BuchiCegarLoop]: Abstraction has 99 states and 109 transitions. [2021-08-31 05:19:06,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 109 transitions. [2021-08-31 05:19:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-08-31 05:19:06,247 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-31 05:19:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2021-08-31 05:19:06,249 INFO L704 BuchiCegarLoop]: Abstraction has 98 states and 108 transitions. [2021-08-31 05:19:06,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:19:06,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 05:19:06,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-31 05:19:06,250 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-31 05:19:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:19:06,298 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2021-08-31 05:19:06,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 05:19:06,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 122 transitions. [2021-08-31 05:19:06,300 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:19:06,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 109 states and 122 transitions. [2021-08-31 05:19:06,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2021-08-31 05:19:06,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2021-08-31 05:19:06,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 122 transitions. [2021-08-31 05:19:06,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:19:06,303 INFO L681 BuchiCegarLoop]: Abstraction has 109 states and 122 transitions. [2021-08-31 05:19:06,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 122 transitions. [2021-08-31 05:19:06,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2021-08-31 05:19:06,308 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-31 05:19:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-08-31 05:19:06,308 INFO L704 BuchiCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-08-31 05:19:06,308 INFO L587 BuchiCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-08-31 05:19:06,308 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-31 05:19:06,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 106 transitions. [2021-08-31 05:19:06,309 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:19:06,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:06,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:06,310 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:19:06,310 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:19:06,314 INFO L791 eck$LassoCheckResult]: Stem: 2736#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); 2737#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; 2753#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; 2754#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2755#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; 2756#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2793#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; 2792#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2791#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; 2790#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2789#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; 2788#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2787#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; 2786#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2785#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; 2784#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2783#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; 2782#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2779#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; 2777#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2776#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; 2773#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2772#L17-3 assume !(init_nondet_~i~0 < 10); 2744#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; 2745#L28-3 assume !!(rangesum_~i~1 < 10); 2746#L29 assume !(rangesum_~i~1 > 5); 2747#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2750#L28-3 assume !!(rangesum_~i~1 < 10); 2748#L29 assume !(rangesum_~i~1 > 5); 2749#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2751#L28-3 assume !!(rangesum_~i~1 < 10); 2768#L29 assume !(rangesum_~i~1 > 5); 2806#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2805#L28-3 assume !!(rangesum_~i~1 < 10); 2804#L29 assume !(rangesum_~i~1 > 5); 2803#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2802#L28-3 assume !!(rangesum_~i~1 < 10); 2801#L29 assume !(rangesum_~i~1 > 5); 2800#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2799#L28-3 assume !!(rangesum_~i~1 < 10); 2798#L29 assume !(rangesum_~i~1 > 5); 2781#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2797#L28-3 assume !!(rangesum_~i~1 < 10); 2780#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; 2778#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2766#L28-3 assume !(rangesum_~i~1 < 10); 2767#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); 2760#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; 2761#L28-8 assume !!(rangesum_~i~1 < 10); 2771#L29-2 assume !(rangesum_~i~1 > 5); 2757#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2742#L28-8 assume !!(rangesum_~i~1 < 10); 2743#L29-2 assume !(rangesum_~i~1 > 5); 2758#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2759#L28-8 assume !!(rangesum_~i~1 < 10); 2817#L29-2 assume !(rangesum_~i~1 > 5); 2816#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2815#L28-8 assume !!(rangesum_~i~1 < 10); 2814#L29-2 assume !(rangesum_~i~1 > 5); 2813#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2812#L28-8 assume !!(rangesum_~i~1 < 10); 2809#L29-2 assume !(rangesum_~i~1 > 5); 2810#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2811#L28-8 assume !!(rangesum_~i~1 < 10); 2796#L29-2 assume !(rangesum_~i~1 > 5); 2794#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2740#L28-8 assume !!(rangesum_~i~1 < 10); 2741#L29-2 [2021-08-31 05:19:06,314 INFO L793 eck$LassoCheckResult]: Loop: 2741#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; 2775#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2774#L28-8 assume !!(rangesum_~i~1 < 10); 2741#L29-2 [2021-08-31 05:19:06,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:06,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1815162476, now seen corresponding path program 1 times [2021-08-31 05:19:06,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:06,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792026334] [2021-08-31 05:19:06,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:06,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:06,323 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-31 05:19:06,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285949723] [2021-08-31 05:19:06,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:06,324 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:19:06,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:06,325 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-31 05:19:06,326 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-31 05:19:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:06,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-31 05:19:06,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:06,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:06,528 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-31 05:19:06,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:19:06,660 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-31 05:19:06,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:19:06,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792026334] [2021-08-31 05:19:06,661 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-31 05:19:06,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285949723] [2021-08-31 05:19:06,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285949723] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:19:06,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-31 05:19:06,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2021-08-31 05:19:06,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405356911] [2021-08-31 05:19:06,661 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:19:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:06,662 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 2 times [2021-08-31 05:19:06,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:06,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980848374] [2021-08-31 05:19:06,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:06,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:06,664 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:06,666 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:06,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:19:06,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-31 05:19:06,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-08-31 05:19:06,703 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. cyclomatic complexity: 14 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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-31 05:19:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:19:06,841 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2021-08-31 05:19:06,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-31 05:19:06,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 162 transitions. [2021-08-31 05:19:06,843 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2021-08-31 05:19:06,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 139 states and 156 transitions. [2021-08-31 05:19:06,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2021-08-31 05:19:06,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2021-08-31 05:19:06,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 156 transitions. [2021-08-31 05:19:06,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:19:06,845 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 156 transitions. [2021-08-31 05:19:06,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 156 transitions. [2021-08-31 05:19:06,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2021-08-31 05:19:06,846 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-31 05:19:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2021-08-31 05:19:06,846 INFO L704 BuchiCegarLoop]: Abstraction has 116 states and 127 transitions. [2021-08-31 05:19:06,846 INFO L587 BuchiCegarLoop]: Abstraction has 116 states and 127 transitions. [2021-08-31 05:19:06,846 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-31 05:19:06,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 127 transitions. [2021-08-31 05:19:06,847 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:19:06,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:06,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:06,848 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-31 05:19:06,848 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:19:06,848 INFO L791 eck$LassoCheckResult]: Stem: 3390#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); 3391#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; 3412#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; 3413#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3414#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; 3415#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3421#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; 3464#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3463#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; 3462#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3461#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; 3460#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3459#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; 3458#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3457#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; 3456#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3454#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; 3452#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3450#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; 3448#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3446#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; 3429#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3428#L17-3 assume !(init_nondet_~i~0 < 10); 3398#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; 3399#L28-3 assume !!(rangesum_~i~1 < 10); 3400#L29 assume !(rangesum_~i~1 > 5); 3401#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3406#L28-3 assume !!(rangesum_~i~1 < 10); 3481#L29 assume !(rangesum_~i~1 > 5); 3407#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3408#L28-3 assume !!(rangesum_~i~1 < 10); 3402#L29 assume !(rangesum_~i~1 > 5); 3403#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3480#L28-3 assume !!(rangesum_~i~1 < 10); 3479#L29 assume !(rangesum_~i~1 > 5); 3478#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3477#L28-3 assume !!(rangesum_~i~1 < 10); 3476#L29 assume !(rangesum_~i~1 > 5); 3475#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3474#L28-3 assume !!(rangesum_~i~1 < 10); 3473#L29 assume !(rangesum_~i~1 > 5); 3437#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3472#L28-3 assume !!(rangesum_~i~1 < 10); 3471#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; 3470#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3469#L28-3 assume !!(rangesum_~i~1 < 10); 3468#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; 3467#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3466#L28-3 assume !!(rangesum_~i~1 < 10); 3465#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; 3436#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3438#L28-3 assume !!(rangesum_~i~1 < 10); 3435#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; 3433#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3430#L28-3 assume !(rangesum_~i~1 < 10); 3425#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); 3420#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; 3394#L28-8 assume !!(rangesum_~i~1 < 10); 3395#L29-2 assume !(rangesum_~i~1 > 5); 3409#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3410#L28-8 assume !!(rangesum_~i~1 < 10); 3485#L29-2 assume !(rangesum_~i~1 > 5); 3484#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3482#L28-8 assume !!(rangesum_~i~1 < 10); 3483#L29-2 assume !(rangesum_~i~1 > 5); 3490#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3489#L28-8 assume !!(rangesum_~i~1 < 10); 3488#L29-2 assume !(rangesum_~i~1 > 5); 3487#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3486#L28-8 assume !!(rangesum_~i~1 < 10); 3426#L29-2 assume !(rangesum_~i~1 > 5); 3427#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3491#L28-8 assume !!(rangesum_~i~1 < 10); 3455#L29-2 assume !(rangesum_~i~1 > 5); 3453#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3451#L28-8 assume !!(rangesum_~i~1 < 10); 3449#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; 3447#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3445#L28-8 assume !!(rangesum_~i~1 < 10); 3444#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; 3443#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3442#L28-8 assume !!(rangesum_~i~1 < 10); 3441#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; 3440#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3439#L28-8 assume !!(rangesum_~i~1 < 10); 3432#L29-2 [2021-08-31 05:19:06,848 INFO L793 eck$LassoCheckResult]: Loop: 3432#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; 3434#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3431#L28-8 assume !!(rangesum_~i~1 < 10); 3432#L29-2 [2021-08-31 05:19:06,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:06,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1484601769, now seen corresponding path program 1 times [2021-08-31 05:19:06,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:06,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128710110] [2021-08-31 05:19:06,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:06,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:06,856 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-31 05:19:06,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [655646956] [2021-08-31 05:19:06,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:06,856 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:19:06,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:06,857 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-31 05:19:06,889 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-31 05:19:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:06,946 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:07,027 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:07,028 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 3 times [2021-08-31 05:19:07,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:07,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078802844] [2021-08-31 05:19:07,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:07,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:07,030 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:07,031 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:07,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:07,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1801965686, now seen corresponding path program 2 times [2021-08-31 05:19:07,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:07,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340733163] [2021-08-31 05:19:07,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:07,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:07,039 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-31 05:19:07,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [65723819] [2021-08-31 05:19:07,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-31 05:19:07,040 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:19:07,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:07,041 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:19:07,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2021-08-31 05:19:07,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-31 05:19:07,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:19:07,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 05:19:07,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:07,253 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-31 05:19:07,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-31 05:19:07,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:19:07,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340733163] [2021-08-31 05:19:07,254 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-31 05:19:07,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65723819] [2021-08-31 05:19:07,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65723819] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:19:07,254 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:19:07,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-31 05:19:07,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473863763] [2021-08-31 05:19:07,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:19:07,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 05:19:07,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-31 05:19:07,298 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-31 05:19:07,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:19:07,373 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2021-08-31 05:19:07,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-31 05:19:07,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 143 transitions. [2021-08-31 05:19:07,374 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-08-31 05:19:07,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 115 states and 119 transitions. [2021-08-31 05:19:07,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2021-08-31 05:19:07,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2021-08-31 05:19:07,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 119 transitions. [2021-08-31 05:19:07,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 05:19:07,375 INFO L681 BuchiCegarLoop]: Abstraction has 115 states and 119 transitions. [2021-08-31 05:19:07,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 119 transitions. [2021-08-31 05:19:07,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2021-08-31 05:19:07,376 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-31 05:19:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2021-08-31 05:19:07,376 INFO L704 BuchiCegarLoop]: Abstraction has 96 states and 100 transitions. [2021-08-31 05:19:07,376 INFO L587 BuchiCegarLoop]: Abstraction has 96 states and 100 transitions. [2021-08-31 05:19:07,376 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-31 05:19:07,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 100 transitions. [2021-08-31 05:19:07,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-08-31 05:19:07,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:07,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:07,377 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-31 05:19:07,377 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 05:19:07,377 INFO L791 eck$LassoCheckResult]: Stem: 3918#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); 3919#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; 3938#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; 3939#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3940#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; 3941#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4001#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; 3999#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3997#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; 3995#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3993#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; 3991#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3990#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; 3988#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3985#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; 3983#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3982#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; 3980#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3977#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; 3975#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3973#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; 3953#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3952#L17-3 assume !(init_nondet_~i~0 < 10); 3926#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; 3927#L28-3 assume !!(rangesum_~i~1 < 10); 3928#L29 assume !(rangesum_~i~1 > 5); 3929#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3933#L28-3 assume !!(rangesum_~i~1 < 10); 3930#L29 assume !(rangesum_~i~1 > 5); 3931#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3934#L28-3 assume !!(rangesum_~i~1 < 10); 4006#L29 assume !(rangesum_~i~1 > 5); 4005#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4004#L28-3 assume !!(rangesum_~i~1 < 10); 4003#L29 assume !(rangesum_~i~1 > 5); 4002#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4000#L28-3 assume !!(rangesum_~i~1 < 10); 3998#L29 assume !(rangesum_~i~1 > 5); 3996#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3994#L28-3 assume !!(rangesum_~i~1 < 10); 3992#L29 assume !(rangesum_~i~1 > 5); 3987#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3989#L28-3 assume !!(rangesum_~i~1 < 10); 3986#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; 3984#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3946#L28-3 assume !!(rangesum_~i~1 < 10); 3947#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; 3969#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3967#L28-3 assume !!(rangesum_~i~1 < 10); 3965#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; 3963#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3961#L28-3 assume !!(rangesum_~i~1 < 10); 3959#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; 3957#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3955#L28-3 assume !(rangesum_~i~1 < 10); 3950#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); 3944#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; 3922#L28-8 assume !!(rangesum_~i~1 < 10); 3923#L29-2 assume !(rangesum_~i~1 > 5); 3935#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3936#L28-8 assume !!(rangesum_~i~1 < 10); 4013#L29-2 assume !(rangesum_~i~1 > 5); 3937#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3924#L28-8 assume !!(rangesum_~i~1 < 10); 3925#L29-2 assume !(rangesum_~i~1 > 5); 3951#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4012#L28-8 assume !!(rangesum_~i~1 < 10); 4011#L29-2 assume !(rangesum_~i~1 > 5); 4010#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4009#L28-8 assume !!(rangesum_~i~1 < 10); 4008#L29-2 assume !(rangesum_~i~1 > 5); 4007#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3979#L28-8 assume !!(rangesum_~i~1 < 10); 3981#L29-2 assume !(rangesum_~i~1 > 5); 3978#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3976#L28-8 assume !!(rangesum_~i~1 < 10); 3974#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; 3972#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3971#L28-8 assume !!(rangesum_~i~1 < 10); 3970#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; 3968#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3966#L28-8 assume !!(rangesum_~i~1 < 10); 3964#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; 3962#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3960#L28-8 assume !!(rangesum_~i~1 < 10); 3958#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; 3956#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3954#L28-8 assume !(rangesum_~i~1 < 10); 3948#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); 3942#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; 3943#L54-3 [2021-08-31 05:19:07,378 INFO L793 eck$LassoCheckResult]: Loop: 3943#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; 3945#L54-2 main_#t~post12 := main_~i~2;main_~i~2 := 1 + main_#t~post12;havoc main_#t~post12; 3943#L54-3 [2021-08-31 05:19:07,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:07,378 INFO L82 PathProgramCache]: Analyzing trace with hash 817204024, now seen corresponding path program 1 times [2021-08-31 05:19:07,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:07,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230144722] [2021-08-31 05:19:07,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:07,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:07,386 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-31 05:19:07,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1770834738] [2021-08-31 05:19:07,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:07,387 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:19:07,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:07,388 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:19:07,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2021-08-31 05:19:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:07,474 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:07,550 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:07,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:07,551 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2021-08-31 05:19:07,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:07,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287211088] [2021-08-31 05:19:07,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:07,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:07,553 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:07,555 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:07,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:07,555 INFO L82 PathProgramCache]: Analyzing trace with hash -645945734, now seen corresponding path program 1 times [2021-08-31 05:19:07,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:07,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301868876] [2021-08-31 05:19:07,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:07,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:07,561 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-31 05:19:07,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1869865884] [2021-08-31 05:19:07,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:07,562 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:19:07,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:07,572 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:19:07,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2021-08-31 05:19:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:07,659 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:07,775 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:21:17,401 WARN L210 SmtUtils]: Spent 2.16m on a formula simplification. DAG size of input: 585 DAG size of output: 411 [2021-08-31 05:22:23,636 WARN L210 SmtUtils]: Spent 29.48s on a formula simplification that was a NOOP. DAG size: 241 [2021-08-31 05:22:23,639 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:22:23,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:22:23,639 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:22:23,639 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:22:23,639 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:22:23,639 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:22:23,639 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:22:23,639 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:22:23,639 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration13_Lasso [2021-08-31 05:22:23,639 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:22:23,639 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:22:23,650 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-31 05:22:27,055 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-31 05:22:27,058 INFO L158 Benchmark]: Toolchain (without parser) took 214028.56ms. Allocated memory was 62.9MB in the beginning and 94.4MB in the end (delta: 31.5MB). Free memory was 43.4MB in the beginning and 27.4MB in the end (delta: 15.9MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. [2021-08-31 05:22:27,059 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory was 45.1MB in the beginning and 45.1MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 05:22:27,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 149.30ms. Allocated memory is still 62.9MB. Free memory was 43.1MB in the beginning and 33.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-08-31 05:22:27,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.76ms. Allocated memory is still 62.9MB. Free memory was 33.3MB in the beginning and 45.7MB in the end (delta: -12.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-31 05:22:27,059 INFO L158 Benchmark]: Boogie Preprocessor took 17.89ms. Allocated memory is still 62.9MB. Free memory was 45.7MB in the beginning and 44.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 05:22:27,059 INFO L158 Benchmark]: RCFGBuilder took 285.94ms. Allocated memory is still 62.9MB. Free memory was 44.3MB in the beginning and 33.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-08-31 05:22:27,060 INFO L158 Benchmark]: BuchiAutomizer took 213510.31ms. Allocated memory was 62.9MB in the beginning and 94.4MB in the end (delta: 31.5MB). Free memory was 33.0MB in the beginning and 27.4MB in the end (delta: 5.6MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2021-08-31 05:22:27,061 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.16ms. Allocated memory is still 62.9MB. Free memory was 45.1MB in the beginning and 45.1MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 149.30ms. Allocated memory is still 62.9MB. Free memory was 43.1MB in the beginning and 33.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.76ms. Allocated memory is still 62.9MB. Free memory was 33.3MB in the beginning and 45.7MB in the end (delta: -12.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.89ms. Allocated memory is still 62.9MB. Free memory was 45.7MB in the beginning and 44.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 285.94ms. Allocated memory is still 62.9MB. Free memory was 44.3MB in the beginning and 33.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 213510.31ms. Allocated memory was 62.9MB in the beginning and 94.4MB in the end (delta: 31.5MB). Free memory was 33.0MB in the beginning and 27.4MB in the end (delta: 5.6MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. * 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-31 05:22:27,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2021-08-31 05:22:27,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2021-08-31 05:22:27,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2021-08-31 05:22:27,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2021-08-31 05:22:27,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2021-08-31 05:22:28,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2021-08-31 05:22:28,285 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-31 05:22:28,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-08-31 05:22:28,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-08-31 05:22:28,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-31 05:22:29,270 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-31 05:22:29,301 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...