./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum10.i -s /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer --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 /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/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: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 22:07:21,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 22:07:21,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 22:07:21,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 22:07:21,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 22:07:21,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 22:07:21,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 22:07:21,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 22:07:21,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 22:07:21,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 22:07:21,313 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 22:07:21,315 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 22:07:21,315 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 22:07:21,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 22:07:21,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 22:07:21,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 22:07:21,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 22:07:21,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 22:07:21,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 22:07:21,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 22:07:21,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 22:07:21,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 22:07:21,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 22:07:21,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 22:07:21,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 22:07:21,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 22:07:21,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 22:07:21,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 22:07:21,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 22:07:21,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 22:07:21,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 22:07:21,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 22:07:21,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 22:07:21,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 22:07:21,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 22:07:21,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 22:07:21,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 22:07:21,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 22:07:21,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 22:07:21,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 22:07:21,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 22:07:21,356 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-29 22:07:21,382 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 22:07:21,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 22:07:21,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 22:07:21,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 22:07:21,385 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 22:07:21,385 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 22:07:21,385 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 22:07:21,385 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 22:07:21,386 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 22:07:21,386 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 22:07:21,386 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 22:07:21,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 22:07:21,387 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 22:07:21,387 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 22:07:21,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 22:07:21,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 22:07:21,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 22:07:21,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 22:07:21,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 22:07:21,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 22:07:21,392 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 22:07:21,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 22:07:21,392 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 22:07:21,393 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 22:07:21,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 22:07:21,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 22:07:21,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 22:07:21,394 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 22:07:21,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 22:07:21,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 22:07:21,396 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 22:07:21,396 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 22:07:21,397 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 22:07:21,397 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:/tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer 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 [2020-11-29 22:07:21,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 22:07:21,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 22:07:21,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 22:07:21,768 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 22:07:21,768 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 22:07:21,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum10.i [2020-11-29 22:07:21,865 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/data/838eb7f6d/58259351ec564a1681620027efc6cae1/FLAG63b09203b [2020-11-29 22:07:22,427 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 22:07:22,428 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/sv-benchmarks/c/reducercommutativity/rangesum10.i [2020-11-29 22:07:22,440 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/data/838eb7f6d/58259351ec564a1681620027efc6cae1/FLAG63b09203b [2020-11-29 22:07:22,769 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/data/838eb7f6d/58259351ec564a1681620027efc6cae1 [2020-11-29 22:07:22,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 22:07:22,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 22:07:22,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 22:07:22,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 22:07:22,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 22:07:22,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:07:22" (1/1) ... [2020-11-29 22:07:22,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d72aeee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:07:22, skipping insertion in model container [2020-11-29 22:07:22,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:07:22" (1/1) ... [2020-11-29 22:07:22,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 22:07:22,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 22:07:23,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 22:07:23,065 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 22:07:23,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 22:07:23,128 INFO L208 MainTranslator]: Completed translation [2020-11-29 22:07:23,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:07:23 WrapperNode [2020-11-29 22:07:23,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 22:07:23,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 22:07:23,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 22:07:23,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 22:07:23,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:07:23" (1/1) ... [2020-11-29 22:07:23,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:07:23" (1/1) ... [2020-11-29 22:07:23,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 22:07:23,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 22:07:23,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 22:07:23,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 22:07:23,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:07:23" (1/1) ... [2020-11-29 22:07:23,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:07:23" (1/1) ... [2020-11-29 22:07:23,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:07:23" (1/1) ... [2020-11-29 22:07:23,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:07:23" (1/1) ... [2020-11-29 22:07:23,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:07:23" (1/1) ... [2020-11-29 22:07:23,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:07:23" (1/1) ... [2020-11-29 22:07:23,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:07:23" (1/1) ... [2020-11-29 22:07:23,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 22:07:23,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 22:07:23,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 22:07:23,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 22:07:23,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:07:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:23,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 22:07:23,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 22:07:23,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 22:07:23,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 22:07:23,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 22:07:23,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 22:07:23,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 22:07:23,930 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 22:07:23,930 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-11-29 22:07:23,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:07:23 BoogieIcfgContainer [2020-11-29 22:07:23,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 22:07:23,932 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 22:07:23,933 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 22:07:23,936 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 22:07:23,937 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 22:07:23,937 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 10:07:22" (1/3) ... [2020-11-29 22:07:23,938 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@715d648f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 10:07:23, skipping insertion in model container [2020-11-29 22:07:23,939 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 22:07:23,939 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:07:23" (2/3) ... [2020-11-29 22:07:23,940 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@715d648f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 10:07:23, skipping insertion in model container [2020-11-29 22:07:23,940 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 22:07:23,940 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:07:23" (3/3) ... [2020-11-29 22:07:23,942 INFO L373 chiAutomizerObserver]: Analyzing ICFG rangesum10.i [2020-11-29 22:07:24,003 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 22:07:24,004 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 22:07:24,004 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 22:07:24,004 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 22:07:24,004 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 22:07:24,004 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 22:07:24,004 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 22:07:24,004 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 22:07:24,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2020-11-29 22:07:24,044 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-11-29 22:07:24,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:24,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:24,050 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 22:07:24,050 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:07:24,051 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 22:07:24,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2020-11-29 22:07:24,056 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2020-11-29 22:07:24,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:24,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:24,057 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 22:07:24,057 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:07:24,064 INFO L794 eck$LassoCheckResult]: Stem: 26#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); 11#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; 29#L17-3true [2020-11-29 22:07:24,064 INFO L796 eck$LassoCheckResult]: Loop: 29#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; 19#L17-2true init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 29#L17-3true [2020-11-29 22:07:24,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:24,074 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-29 22:07:24,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:24,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380208050] [2020-11-29 22:07:24,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:24,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:24,187 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:24,206 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:24,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-11-29 22:07:24,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:24,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629425465] [2020-11-29 22:07:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:24,217 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:24,222 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:24,225 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:24,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:24,227 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-11-29 22:07:24,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:24,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390666249] [2020-11-29 22:07:24,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:24,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:24,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:24,273 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:24,591 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2020-11-29 22:07:24,739 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-11-29 22:07:24,756 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 22:07:24,757 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 22:07:24,757 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 22:07:24,757 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 22:07:24,757 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 22:07:24,757 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:24,758 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 22:07:24,758 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 22:07:24,758 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration1_Lasso [2020-11-29 22:07:24,758 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 22:07:24,759 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 22:07:24,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:24,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:24,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:24,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:24,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:24,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:25,224 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-11-29 22:07:25,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:25,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:25,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:25,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:25,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:25,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:25,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:25,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:25,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:25,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:25,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:25,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:25,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:25,862 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 22:07:25,867 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:07:25,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:25,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:07:25,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:07:25,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:07:25,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:07:25,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:07:25,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:07:25,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:07:25,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:25,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:07:25,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:07:25,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:07:25,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:07:25,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:07:25,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:07:25,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:07:25,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:07:25,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:25,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:07:25,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:07:25,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:07:25,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:07:25,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:07:25,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:07:25,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:07:25,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:07:25,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:25,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:07:25,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:07:25,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:07:25,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:07:25,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:07:26,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:07:26,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:07:26,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:26,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:07:26,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:07:26,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:07:26,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:07:26,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:07:26,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:07:26,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:07:26,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:07:26,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:26,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:07:26,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:07:26,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:07:26,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:07:26,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:07:26,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:07:26,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:07:26,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:07:26,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:07:26,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:07:26,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:07:26,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:07:26,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:07:26,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:07:26,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:26,178 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 22:07:26,319 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-11-29 22:07:26,320 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:26,380 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 22:07:26,411 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 22:07:26,412 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 22:07:26,412 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_init_nondet_~i~0 + 19*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2020-11-29 22:07:26,504 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2020-11-29 22:07:26,513 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-29 22:07:26,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:26,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 22:07:26,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:26,583 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 22:07:26,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:26,642 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 [2020-11-29 22:07:26,643 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states. Second operand 3 states. [2020-11-29 22:07:26,835 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states.. Second operand 3 states. Result 78 states and 124 transitions. Complement of second has 8 states. [2020-11-29 22:07:26,836 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 [2020-11-29 22:07:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 22:07:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2020-11-29 22:07:26,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 2 letters. [2020-11-29 22:07:26,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:07:26,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-29 22:07:26,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:07:26,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 2 letters. Loop has 4 letters. [2020-11-29 22:07:26,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:07:26,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 124 transitions. [2020-11-29 22:07:26,853 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:26,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 22 states and 32 transitions. [2020-11-29 22:07:26,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-11-29 22:07:26,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-29 22:07:26,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2020-11-29 22:07:26,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:26,862 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2020-11-29 22:07:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2020-11-29 22:07:26,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-11-29 22:07:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-29 22:07:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2020-11-29 22:07:26,894 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2020-11-29 22:07:26,894 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2020-11-29 22:07:26,894 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 22:07:26,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2020-11-29 22:07:26,899 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:26,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:26,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:26,899 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-29 22:07:26,899 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:26,900 INFO L794 eck$LassoCheckResult]: Stem: 216#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); 214#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; 215#L17-3 assume !(init_nondet_~i~0 < 10); 198#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; 199#L28-3 [2020-11-29 22:07:26,901 INFO L796 eck$LassoCheckResult]: Loop: 199#L28-3 assume !!(rangesum_~i~1 < 10); 209#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; 202#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 199#L28-3 [2020-11-29 22:07:26,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:26,901 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-11-29 22:07:26,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:26,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821747280] [2020-11-29 22:07:26,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:26,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821747280] [2020-11-29 22:07:26,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:07:26,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 22:07:26,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573740378] [2020-11-29 22:07:26,979 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:07:26,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:26,980 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2020-11-29 22:07:26,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:26,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37822755] [2020-11-29 22:07:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:26,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:27,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:27,005 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:27,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:27,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 22:07:27,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 22:07:27,066 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. cyclomatic complexity: 15 Second operand 3 states. [2020-11-29 22:07:27,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:27,093 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2020-11-29 22:07:27,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 22:07:27,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2020-11-29 22:07:27,098 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:27,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 32 transitions. [2020-11-29 22:07:27,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-29 22:07:27,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-29 22:07:27,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2020-11-29 22:07:27,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:27,100 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2020-11-29 22:07:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2020-11-29 22:07:27,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-11-29 22:07:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-29 22:07:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2020-11-29 22:07:27,102 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-11-29 22:07:27,102 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-11-29 22:07:27,102 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 22:07:27,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2020-11-29 22:07:27,103 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:27,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:27,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:27,108 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-29 22:07:27,109 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:27,110 INFO L794 eck$LassoCheckResult]: Stem: 267#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); 265#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; 266#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 247#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 248#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 [2020-11-29 22:07:27,110 INFO L796 eck$LassoCheckResult]: Loop: 250#L28-3 assume !!(rangesum_~i~1 < 10); 260#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; 253#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 250#L28-3 [2020-11-29 22:07:27,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:27,112 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-11-29 22:07:27,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:27,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428548958] [2020-11-29 22:07:27,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:27,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428548958] [2020-11-29 22:07:27,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085844311] [2020-11-29 22:07:27,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:27,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 22:07:27,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:27,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:07:27,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-29 22:07:27,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528530874] [2020-11-29 22:07:27,218 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:07:27,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:27,219 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2020-11-29 22:07:27,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:27,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552378685] [2020-11-29 22:07:27,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:27,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:27,241 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:27,243 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:27,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:27,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 22:07:27,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 22:07:27,287 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-11-29 22:07:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:27,307 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2020-11-29 22:07:27,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 22:07:27,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2020-11-29 22:07:27,310 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:27,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 34 transitions. [2020-11-29 22:07:27,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-29 22:07:27,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-29 22:07:27,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-11-29 22:07:27,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:27,311 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-11-29 22:07:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-11-29 22:07:27,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-11-29 22:07:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-29 22:07:27,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-11-29 22:07:27,314 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-11-29 22:07:27,314 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-11-29 22:07:27,314 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 22:07:27,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-11-29 22:07:27,315 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:27,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:27,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:27,316 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-11-29 22:07:27,316 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:27,316 INFO L794 eck$LassoCheckResult]: Stem: 337#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); 335#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; 336#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 317#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 318#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 339#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 340#L17-3 assume !(init_nondet_~i~0 < 10); 319#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; 320#L28-3 [2020-11-29 22:07:27,316 INFO L796 eck$LassoCheckResult]: Loop: 320#L28-3 assume !!(rangesum_~i~1 < 10); 330#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; 323#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 320#L28-3 [2020-11-29 22:07:27,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:27,317 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-11-29 22:07:27,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:27,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274447397] [2020-11-29 22:07:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:27,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274447397] [2020-11-29 22:07:27,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304808035] [2020-11-29 22:07:27,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:27,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 22:07:27,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:07:27,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 22:07:27,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:27,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:07:27,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-29 22:07:27,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995810209] [2020-11-29 22:07:27,488 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:07:27,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:27,489 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2020-11-29 22:07:27,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:27,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136781790] [2020-11-29 22:07:27,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:27,495 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:27,499 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:27,501 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:27,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:27,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 22:07:27,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:07:27,544 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-11-29 22:07:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:27,572 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-11-29 22:07:27,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 22:07:27,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2020-11-29 22:07:27,575 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:27,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 36 transitions. [2020-11-29 22:07:27,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-29 22:07:27,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-29 22:07:27,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2020-11-29 22:07:27,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:27,576 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-11-29 22:07:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2020-11-29 22:07:27,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2020-11-29 22:07:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-11-29 22:07:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2020-11-29 22:07:27,579 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-11-29 22:07:27,579 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-11-29 22:07:27,579 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 22:07:27,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2020-11-29 22:07:27,580 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:27,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:27,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:27,581 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-11-29 22:07:27,581 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:27,581 INFO L794 eck$LassoCheckResult]: Stem: 418#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); 416#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; 417#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 420#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 421#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 400#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 401#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 423#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 422#L17-3 assume !(init_nondet_~i~0 < 10); 402#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; 403#L28-3 [2020-11-29 22:07:27,581 INFO L796 eck$LassoCheckResult]: Loop: 403#L28-3 assume !!(rangesum_~i~1 < 10); 411#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; 404#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 403#L28-3 [2020-11-29 22:07:27,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:27,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-11-29 22:07:27,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:27,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055229326] [2020-11-29 22:07:27,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:27,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055229326] [2020-11-29 22:07:27,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652366533] [2020-11-29 22:07:27,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:27,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-29 22:07:27,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:07:27,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 22:07:27,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:27,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:07:27,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-29 22:07:27,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768720782] [2020-11-29 22:07:27,775 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:07:27,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:27,775 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2020-11-29 22:07:27,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:27,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686865618] [2020-11-29 22:07:27,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:27,780 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:27,783 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:27,791 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:27,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:27,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 22:07:27,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-11-29 22:07:27,844 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 14 Second operand 7 states. [2020-11-29 22:07:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:27,871 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2020-11-29 22:07:27,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 22:07:27,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2020-11-29 22:07:27,876 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:27,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 38 transitions. [2020-11-29 22:07:27,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-29 22:07:27,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-29 22:07:27,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2020-11-29 22:07:27,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:27,877 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-11-29 22:07:27,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2020-11-29 22:07:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-11-29 22:07:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-11-29 22:07:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2020-11-29 22:07:27,882 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2020-11-29 22:07:27,883 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2020-11-29 22:07:27,883 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-29 22:07:27,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2020-11-29 22:07:27,883 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:27,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:27,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:27,885 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-11-29 22:07:27,886 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:27,886 INFO L794 eck$LassoCheckResult]: Stem: 510#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); 508#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; 509#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 512#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 513#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 490#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 491#L17-3 assume !!(init_nondet_~i~0 < 10);call write~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); 492#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; 493#L28-3 [2020-11-29 22:07:27,886 INFO L796 eck$LassoCheckResult]: Loop: 493#L28-3 assume !!(rangesum_~i~1 < 10); 503#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; 496#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 493#L28-3 [2020-11-29 22:07:27,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:27,887 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-11-29 22:07:27,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:27,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76413425] [2020-11-29 22:07:27,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:27,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76413425] [2020-11-29 22:07:27,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954796093] [2020-11-29 22:07:27,978 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:28,034 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 22:07:28,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:07:28,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 22:07:28,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:28,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:07:28,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-11-29 22:07:28,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131535423] [2020-11-29 22:07:28,099 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:07:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:28,099 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2020-11-29 22:07:28,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:28,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543556542] [2020-11-29 22:07:28,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:28,104 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:28,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:28,116 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:28,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:28,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 22:07:28,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-11-29 22:07:28,170 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 8 states. [2020-11-29 22:07:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:28,207 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-11-29 22:07:28,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 22:07:28,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2020-11-29 22:07:28,211 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:28,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2020-11-29 22:07:28,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-29 22:07:28,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-29 22:07:28,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2020-11-29 22:07:28,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:28,212 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-11-29 22:07:28,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2020-11-29 22:07:28,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-11-29 22:07:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-29 22:07:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2020-11-29 22:07:28,215 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-11-29 22:07:28,215 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-11-29 22:07:28,215 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-29 22:07:28,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2020-11-29 22:07:28,219 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:28,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:28,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:28,221 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-11-29 22:07:28,221 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:28,221 INFO L794 eck$LassoCheckResult]: Stem: 613#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); 611#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; 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; 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; 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; 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; 594#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 622#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 621#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 620#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 619#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 618#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 617#L17-3 assume !(init_nondet_~i~0 < 10); 597#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; 598#L28-3 [2020-11-29 22:07:28,221 INFO L796 eck$LassoCheckResult]: Loop: 598#L28-3 assume !!(rangesum_~i~1 < 10); 606#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; 599#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 598#L28-3 [2020-11-29 22:07:28,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:28,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-11-29 22:07:28,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:28,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801340601] [2020-11-29 22:07:28,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:28,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801340601] [2020-11-29 22:07:28,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866686619] [2020-11-29 22:07:28,342 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:28,410 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-11-29 22:07:28,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:07:28,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 22:07:28,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:28,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:07:28,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-11-29 22:07:28,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716511702] [2020-11-29 22:07:28,451 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:07:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:28,452 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2020-11-29 22:07:28,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:28,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184692259] [2020-11-29 22:07:28,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:28,459 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:28,466 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:28,470 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:28,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:28,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 22:07:28,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:07:28,515 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand 9 states. [2020-11-29 22:07:28,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:28,559 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2020-11-29 22:07:28,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 22:07:28,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 42 transitions. [2020-11-29 22:07:28,561 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:28,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 42 transitions. [2020-11-29 22:07:28,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-29 22:07:28,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-29 22:07:28,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2020-11-29 22:07:28,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:28,562 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2020-11-29 22:07:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2020-11-29 22:07:28,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-11-29 22:07:28,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-29 22:07:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2020-11-29 22:07:28,565 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2020-11-29 22:07:28,565 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2020-11-29 22:07:28,565 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-29 22:07:28,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2020-11-29 22:07:28,566 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:28,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:28,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:28,567 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2020-11-29 22:07:28,567 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:28,567 INFO L794 eck$LassoCheckResult]: Stem: 727#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); 725#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; 726#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 729#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 730#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 709#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 710#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 738#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 737#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 736#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 735#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 734#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 733#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 732#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 731#L17-3 assume !(init_nondet_~i~0 < 10); 711#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; 712#L28-3 [2020-11-29 22:07:28,567 INFO L796 eck$LassoCheckResult]: Loop: 712#L28-3 assume !!(rangesum_~i~1 < 10); 720#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; 713#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 712#L28-3 [2020-11-29 22:07:28,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:28,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2020-11-29 22:07:28,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:28,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870580658] [2020-11-29 22:07:28,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:28,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870580658] [2020-11-29 22:07:28,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695052471] [2020-11-29 22:07:28,657 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:28,732 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-11-29 22:07:28,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:07:28,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 22:07:28,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:28,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:07:28,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-29 22:07:28,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887711114] [2020-11-29 22:07:28,763 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:07:28,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:28,764 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 7 times [2020-11-29 22:07:28,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:28,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911753098] [2020-11-29 22:07:28,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:28,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:28,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:28,772 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:28,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:28,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 22:07:28,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-11-29 22:07:28,809 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand 10 states. [2020-11-29 22:07:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:28,842 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2020-11-29 22:07:28,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 22:07:28,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2020-11-29 22:07:28,844 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:28,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 44 transitions. [2020-11-29 22:07:28,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-29 22:07:28,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-29 22:07:28,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2020-11-29 22:07:28,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:28,847 INFO L691 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-11-29 22:07:28,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2020-11-29 22:07:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-11-29 22:07:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-29 22:07:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2020-11-29 22:07:28,850 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-11-29 22:07:28,850 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-11-29 22:07:28,850 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-29 22:07:28,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2020-11-29 22:07:28,851 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:28,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:28,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:28,851 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2020-11-29 22:07:28,852 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:28,852 INFO L794 eck$LassoCheckResult]: Stem: 852#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); 850#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; 851#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 854#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 855#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 832#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 833#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 865#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 864#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 863#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 862#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 861#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 860#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 859#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 858#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 857#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 856#L17-3 assume !(init_nondet_~i~0 < 10); 834#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; 835#L28-3 [2020-11-29 22:07:28,852 INFO L796 eck$LassoCheckResult]: Loop: 835#L28-3 assume !!(rangesum_~i~1 < 10); 845#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; 838#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 835#L28-3 [2020-11-29 22:07:28,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:28,853 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2020-11-29 22:07:28,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:28,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567795026] [2020-11-29 22:07:28,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:28,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567795026] [2020-11-29 22:07:28,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908257013] [2020-11-29 22:07:28,998 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:29,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 22:07:29,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:29,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:07:29,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-11-29 22:07:29,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693214525] [2020-11-29 22:07:29,132 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:07:29,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:29,133 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 8 times [2020-11-29 22:07:29,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:29,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610142137] [2020-11-29 22:07:29,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:29,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:29,141 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:29,142 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:29,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:29,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 22:07:29,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-11-29 22:07:29,221 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand 11 states. [2020-11-29 22:07:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:29,276 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-11-29 22:07:29,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 22:07:29,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2020-11-29 22:07:29,281 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:29,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2020-11-29 22:07:29,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-29 22:07:29,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-29 22:07:29,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2020-11-29 22:07:29,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:29,282 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2020-11-29 22:07:29,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2020-11-29 22:07:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-11-29 22:07:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-11-29 22:07:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2020-11-29 22:07:29,285 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2020-11-29 22:07:29,285 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2020-11-29 22:07:29,285 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-29 22:07:29,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2020-11-29 22:07:29,286 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:29,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:29,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:29,286 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2020-11-29 22:07:29,286 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:29,287 INFO L794 eck$LassoCheckResult]: Stem: 988#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); 986#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; 987#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 990#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 991#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 970#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 971#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1003#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1002#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1001#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1000#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 999#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 998#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 997#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 996#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 995#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 994#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 993#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 992#L17-3 assume !(init_nondet_~i~0 < 10); 972#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; 973#L28-3 [2020-11-29 22:07:29,287 INFO L796 eck$LassoCheckResult]: Loop: 973#L28-3 assume !!(rangesum_~i~1 < 10); 981#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; 974#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 973#L28-3 [2020-11-29 22:07:29,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:29,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2020-11-29 22:07:29,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:29,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909048857] [2020-11-29 22:07:29,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:29,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909048857] [2020-11-29 22:07:29,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176459468] [2020-11-29 22:07:29,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:29,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 22:07:29,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:07:29,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 22:07:29,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:29,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:07:29,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-11-29 22:07:29,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644898295] [2020-11-29 22:07:29,513 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:07:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:29,514 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 9 times [2020-11-29 22:07:29,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:29,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479756692] [2020-11-29 22:07:29,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:29,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:29,525 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:29,527 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:29,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:29,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 22:07:29,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:07:29,578 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand 12 states. [2020-11-29 22:07:29,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:29,631 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2020-11-29 22:07:29,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 22:07:29,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2020-11-29 22:07:29,633 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:29,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2020-11-29 22:07:29,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-29 22:07:29,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-29 22:07:29,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2020-11-29 22:07:29,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:29,634 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2020-11-29 22:07:29,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2020-11-29 22:07:29,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2020-11-29 22:07:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-11-29 22:07:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2020-11-29 22:07:29,636 INFO L714 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2020-11-29 22:07:29,636 INFO L594 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2020-11-29 22:07:29,637 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-29 22:07:29,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2020-11-29 22:07:29,637 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:29,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:29,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:29,638 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2020-11-29 22:07:29,638 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:29,638 INFO L794 eck$LassoCheckResult]: Stem: 1135#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); 1133#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; 1134#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1137#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1138#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1115#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1116#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1152#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1151#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1150#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1149#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1148#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1147#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1146#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1145#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1144#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1143#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1142#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1141#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1140#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1139#L17-3 assume !(init_nondet_~i~0 < 10); 1117#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; 1118#L28-3 [2020-11-29 22:07:29,638 INFO L796 eck$LassoCheckResult]: Loop: 1118#L28-3 assume !!(rangesum_~i~1 < 10); 1128#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; 1121#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1118#L28-3 [2020-11-29 22:07:29,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:29,638 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2020-11-29 22:07:29,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:29,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704508475] [2020-11-29 22:07:29,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:29,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704508475] [2020-11-29 22:07:29,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877159749] [2020-11-29 22:07:29,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:29,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-11-29 22:07:29,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:07:29,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-29 22:07:29,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:29,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:07:29,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-11-29 22:07:29,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338847632] [2020-11-29 22:07:29,935 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:07:29,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:29,935 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 10 times [2020-11-29 22:07:29,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:29,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564683225] [2020-11-29 22:07:29,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:29,939 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:29,941 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:29,943 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:29,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:29,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 22:07:29,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-11-29 22:07:29,997 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand 13 states. [2020-11-29 22:07:30,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:30,070 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2020-11-29 22:07:30,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 22:07:30,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2020-11-29 22:07:30,073 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:30,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2020-11-29 22:07:30,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-29 22:07:30,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-29 22:07:30,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2020-11-29 22:07:30,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:30,074 INFO L691 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2020-11-29 22:07:30,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2020-11-29 22:07:30,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-11-29 22:07:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-29 22:07:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2020-11-29 22:07:30,083 INFO L714 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2020-11-29 22:07:30,083 INFO L594 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2020-11-29 22:07:30,083 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-29 22:07:30,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2020-11-29 22:07:30,084 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:30,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:30,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:30,085 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2020-11-29 22:07:30,086 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:30,086 INFO L794 eck$LassoCheckResult]: Stem: 1292#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); 1290#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; 1291#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1294#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 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; 1272#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1273#L17-3 assume !!(init_nondet_~i~0 < 10);call write~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);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1309#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1308#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1307#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1306#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1305#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1304#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1303#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1302#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1301#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1300#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1299#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1298#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1297#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1296#L17-3 assume !(init_nondet_~i~0 < 10); 1274#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; 1275#L28-3 [2020-11-29 22:07:30,086 INFO L796 eck$LassoCheckResult]: Loop: 1275#L28-3 assume !!(rangesum_~i~1 < 10); 1285#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; 1278#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1275#L28-3 [2020-11-29 22:07:30,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:30,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2020-11-29 22:07:30,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:30,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443078089] [2020-11-29 22:07:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:30,119 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:30,136 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:30,144 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:30,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:30,145 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 11 times [2020-11-29 22:07:30,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:30,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896740514] [2020-11-29 22:07:30,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:30,149 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:30,151 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:30,152 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:30,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:30,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1328180093, now seen corresponding path program 1 times [2020-11-29 22:07:30,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:30,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827612883] [2020-11-29 22:07:30,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 22:07:30,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827612883] [2020-11-29 22:07:30,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:07:30,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 22:07:30,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407066435] [2020-11-29 22:07:30,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:30,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 22:07:30,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 22:07:30,220 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand 3 states. [2020-11-29 22:07:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:30,267 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2020-11-29 22:07:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 22:07:30,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2020-11-29 22:07:30,268 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:30,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 58 transitions. [2020-11-29 22:07:30,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-11-29 22:07:30,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-11-29 22:07:30,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 58 transitions. [2020-11-29 22:07:30,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:30,270 INFO L691 BuchiCegarLoop]: Abstraction has 49 states and 58 transitions. [2020-11-29 22:07:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 58 transitions. [2020-11-29 22:07:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2020-11-29 22:07:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-29 22:07:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2020-11-29 22:07:30,273 INFO L714 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2020-11-29 22:07:30,273 INFO L594 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2020-11-29 22:07:30,273 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-11-29 22:07:30,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2020-11-29 22:07:30,273 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:30,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:30,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:30,274 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2020-11-29 22:07:30,274 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:30,274 INFO L794 eck$LassoCheckResult]: Stem: 1392#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); 1389#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; 1390#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1369#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1370#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1394#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1413#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1412#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1411#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1410#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1409#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1408#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1407#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1406#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1405#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1404#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1403#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1402#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1401#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1400#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1399#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1396#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1395#L17-3 assume !(init_nondet_~i~0 < 10); 1371#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; 1372#L28-3 assume !!(rangesum_~i~1 < 10); 1384#L29 assume !(rangesum_~i~1 > 5); 1375#L28-2 [2020-11-29 22:07:30,274 INFO L796 eck$LassoCheckResult]: Loop: 1375#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1376#L28-3 assume !!(rangesum_~i~1 < 10); 1397#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; 1375#L28-2 [2020-11-29 22:07:30,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:30,275 INFO L82 PathProgramCache]: Analyzing trace with hash -95702812, now seen corresponding path program 1 times [2020-11-29 22:07:30,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:30,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710124517] [2020-11-29 22:07:30,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:30,288 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:30,310 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:30,326 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:30,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:30,330 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 12 times [2020-11-29 22:07:30,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:30,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120486974] [2020-11-29 22:07:30,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:30,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:30,335 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:30,337 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:30,337 INFO L82 PathProgramCache]: Analyzing trace with hash 775842814, now seen corresponding path program 1 times [2020-11-29 22:07:30,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:30,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070478570] [2020-11-29 22:07:30,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 22:07:30,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070478570] [2020-11-29 22:07:30,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670541370] [2020-11-29 22:07:30,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:30,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 22:07:30,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 22:07:30,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:07:30,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2020-11-29 22:07:30,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982327690] [2020-11-29 22:07:30,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:30,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 22:07:30,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-29 22:07:30,561 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-11-29 22:07:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:30,656 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-11-29 22:07:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 22:07:30,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 67 transitions. [2020-11-29 22:07:30,657 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:30,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 67 transitions. [2020-11-29 22:07:30,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2020-11-29 22:07:30,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2020-11-29 22:07:30,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2020-11-29 22:07:30,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:30,659 INFO L691 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2020-11-29 22:07:30,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2020-11-29 22:07:30,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-11-29 22:07:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-11-29 22:07:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2020-11-29 22:07:30,669 INFO L714 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2020-11-29 22:07:30,669 INFO L594 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2020-11-29 22:07:30,669 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-11-29 22:07:30,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 64 transitions. [2020-11-29 22:07:30,669 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:30,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:30,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:30,672 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 1, 1, 1, 1, 1] [2020-11-29 22:07:30,672 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:30,673 INFO L794 eck$LassoCheckResult]: Stem: 1592#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); 1589#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; 1590#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1569#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1570#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1594#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1618#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1617#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1616#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1615#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1614#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1613#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1612#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1611#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1610#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1609#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1607#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1606#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1605#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1603#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1602#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1597#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1596#L17-3 assume !(init_nondet_~i~0 < 10); 1571#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; 1572#L28-3 assume !!(rangesum_~i~1 < 10); 1604#L29 assume !(rangesum_~i~1 > 5); 1573#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1574#L28-3 assume !!(rangesum_~i~1 < 10); 1582#L29 assume !(rangesum_~i~1 > 5); 1583#L28-2 [2020-11-29 22:07:30,676 INFO L796 eck$LassoCheckResult]: Loop: 1583#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1598#L28-3 assume !!(rangesum_~i~1 < 10); 1599#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; 1583#L28-2 [2020-11-29 22:07:30,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:30,676 INFO L82 PathProgramCache]: Analyzing trace with hash 775842816, now seen corresponding path program 1 times [2020-11-29 22:07:30,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:30,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442077672] [2020-11-29 22:07:30,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:30,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:30,718 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:30,724 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:30,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:30,731 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 13 times [2020-11-29 22:07:30,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:30,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102404487] [2020-11-29 22:07:30,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:30,738 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:30,745 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:30,747 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:30,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1914342242, now seen corresponding path program 2 times [2020-11-29 22:07:30,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:30,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387784793] [2020-11-29 22:07:30,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 22:07:30,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387784793] [2020-11-29 22:07:30,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004224638] [2020-11-29 22:07:30,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:30,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 22:07:30,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:07:30,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 22:07:30,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 22:07:30,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:07:30,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-11-29 22:07:30,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894881726] [2020-11-29 22:07:30,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:30,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 22:07:30,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:07:30,936 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-11-29 22:07:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:31,027 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2020-11-29 22:07:31,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 22:07:31,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 76 transitions. [2020-11-29 22:07:31,028 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:31,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 76 transitions. [2020-11-29 22:07:31,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2020-11-29 22:07:31,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2020-11-29 22:07:31,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 76 transitions. [2020-11-29 22:07:31,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:31,030 INFO L691 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2020-11-29 22:07:31,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 76 transitions. [2020-11-29 22:07:31,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2020-11-29 22:07:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-29 22:07:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2020-11-29 22:07:31,033 INFO L714 BuchiCegarLoop]: Abstraction has 64 states and 73 transitions. [2020-11-29 22:07:31,033 INFO L594 BuchiCegarLoop]: Abstraction has 64 states and 73 transitions. [2020-11-29 22:07:31,033 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-11-29 22:07:31,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 73 transitions. [2020-11-29 22:07:31,034 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:31,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:31,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:31,035 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 2, 1, 1, 1, 1] [2020-11-29 22:07:31,035 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:31,035 INFO L794 eck$LassoCheckResult]: Stem: 1818#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); 1815#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; 1816#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1793#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1794#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1820#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1845#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1844#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1843#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1842#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1841#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1840#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1839#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1838#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1837#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1836#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1835#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1834#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1833#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1832#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1830#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1824#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1823#L17-3 assume !(init_nondet_~i~0 < 10); 1795#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; 1796#L28-3 assume !!(rangesum_~i~1 < 10); 1851#L29 assume !(rangesum_~i~1 > 5); 1799#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1800#L28-3 assume !!(rangesum_~i~1 < 10); 1808#L29 assume !(rangesum_~i~1 > 5); 1809#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1850#L28-3 assume !!(rangesum_~i~1 < 10); 1849#L29 assume !(rangesum_~i~1 > 5); 1829#L28-2 [2020-11-29 22:07:31,035 INFO L796 eck$LassoCheckResult]: Loop: 1829#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1825#L28-3 assume !!(rangesum_~i~1 < 10); 1826#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; 1829#L28-2 [2020-11-29 22:07:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:31,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1914342244, now seen corresponding path program 2 times [2020-11-29 22:07:31,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:31,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907254627] [2020-11-29 22:07:31,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:31,048 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:31,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:31,065 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:31,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:31,066 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 14 times [2020-11-29 22:07:31,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:31,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076581072] [2020-11-29 22:07:31,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:31,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:31,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:31,072 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:31,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:31,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1594065278, now seen corresponding path program 3 times [2020-11-29 22:07:31,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:31,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970682216] [2020-11-29 22:07:31,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 22:07:31,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970682216] [2020-11-29 22:07:31,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042225739] [2020-11-29 22:07:31,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:31,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-11-29 22:07:31,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:07:31,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 22:07:31,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 22:07:31,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:07:31,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-29 22:07:31,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463466246] [2020-11-29 22:07:31,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:31,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 22:07:31,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-11-29 22:07:31,352 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. cyclomatic complexity: 14 Second operand 7 states. [2020-11-29 22:07:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:31,475 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2020-11-29 22:07:31,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 22:07:31,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 85 transitions. [2020-11-29 22:07:31,477 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:31,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 85 transitions. [2020-11-29 22:07:31,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2020-11-29 22:07:31,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-11-29 22:07:31,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 85 transitions. [2020-11-29 22:07:31,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:31,479 INFO L691 BuchiCegarLoop]: Abstraction has 76 states and 85 transitions. [2020-11-29 22:07:31,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 85 transitions. [2020-11-29 22:07:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2020-11-29 22:07:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-29 22:07:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2020-11-29 22:07:31,483 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 82 transitions. [2020-11-29 22:07:31,483 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 82 transitions. [2020-11-29 22:07:31,483 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-11-29 22:07:31,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 82 transitions. [2020-11-29 22:07:31,484 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:31,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:31,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:31,485 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 3, 1, 1, 1, 1] [2020-11-29 22:07:31,485 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:31,485 INFO L794 eck$LassoCheckResult]: Stem: 2071#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); 2068#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; 2069#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2047#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2048#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2073#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2096#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2095#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2094#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2093#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2092#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2091#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2090#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2089#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2088#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2087#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2086#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2085#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2084#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2083#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2081#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2075#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2074#L17-3 assume !(init_nondet_~i~0 < 10); 2049#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; 2050#L28-3 assume !!(rangesum_~i~1 < 10); 2062#L29 assume !(rangesum_~i~1 > 5); 2053#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2054#L28-3 assume !!(rangesum_~i~1 < 10); 2109#L29 assume !(rangesum_~i~1 > 5); 2108#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2107#L28-3 assume !!(rangesum_~i~1 < 10); 2106#L29 assume !(rangesum_~i~1 > 5); 2105#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2104#L28-3 assume !!(rangesum_~i~1 < 10); 2103#L29 assume !(rangesum_~i~1 > 5); 2080#L28-2 [2020-11-29 22:07:31,485 INFO L796 eck$LassoCheckResult]: Loop: 2080#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2076#L28-3 assume !!(rangesum_~i~1 < 10); 2077#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; 2080#L28-2 [2020-11-29 22:07:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:31,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1594065280, now seen corresponding path program 3 times [2020-11-29 22:07:31,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:31,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800994693] [2020-11-29 22:07:31,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:31,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:31,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:31,551 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:31,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:31,552 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 15 times [2020-11-29 22:07:31,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:31,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636143823] [2020-11-29 22:07:31,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:31,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:31,559 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:31,562 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:31,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:31,564 INFO L82 PathProgramCache]: Analyzing trace with hash -654604830, now seen corresponding path program 4 times [2020-11-29 22:07:31,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:31,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241556240] [2020-11-29 22:07:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 22:07:31,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241556240] [2020-11-29 22:07:31,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830546629] [2020-11-29 22:07:31,690 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:31,749 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 22:07:31,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:07:31,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 22:07:31,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 22:07:31,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:07:31,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-29 22:07:31,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54577769] [2020-11-29 22:07:31,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:31,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 22:07:31,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-11-29 22:07:31,818 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. cyclomatic complexity: 14 Second operand 8 states. [2020-11-29 22:07:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:31,928 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2020-11-29 22:07:31,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 22:07:31,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 94 transitions. [2020-11-29 22:07:31,930 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:31,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 94 transitions. [2020-11-29 22:07:31,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2020-11-29 22:07:31,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2020-11-29 22:07:31,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 94 transitions. [2020-11-29 22:07:31,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:31,931 INFO L691 BuchiCegarLoop]: Abstraction has 85 states and 94 transitions. [2020-11-29 22:07:31,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 94 transitions. [2020-11-29 22:07:31,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2020-11-29 22:07:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-29 22:07:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2020-11-29 22:07:31,935 INFO L714 BuchiCegarLoop]: Abstraction has 82 states and 91 transitions. [2020-11-29 22:07:31,935 INFO L594 BuchiCegarLoop]: Abstraction has 82 states and 91 transitions. [2020-11-29 22:07:31,935 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-11-29 22:07:31,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 91 transitions. [2020-11-29 22:07:31,936 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:31,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:31,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:31,937 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 4, 1, 1, 1, 1] [2020-11-29 22:07:31,937 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:31,937 INFO L794 eck$LassoCheckResult]: Stem: 2354#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); 2351#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; 2352#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2331#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2332#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2356#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2379#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2378#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2377#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2376#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2375#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2374#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2373#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2372#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2371#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2370#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2369#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2368#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2367#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2366#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2364#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2358#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2357#L17-3 assume !(init_nondet_~i~0 < 10); 2333#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; 2334#L28-3 assume !!(rangesum_~i~1 < 10); 2397#L29 assume !(rangesum_~i~1 > 5); 2335#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2336#L28-3 assume !!(rangesum_~i~1 < 10); 2344#L29 assume !(rangesum_~i~1 > 5); 2345#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2396#L28-3 assume !!(rangesum_~i~1 < 10); 2395#L29 assume !(rangesum_~i~1 > 5); 2394#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2393#L28-3 assume !!(rangesum_~i~1 < 10); 2392#L29 assume !(rangesum_~i~1 > 5); 2391#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2390#L28-3 assume !!(rangesum_~i~1 < 10); 2388#L29 assume !(rangesum_~i~1 > 5); 2363#L28-2 [2020-11-29 22:07:31,937 INFO L796 eck$LassoCheckResult]: Loop: 2363#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2359#L28-3 assume !!(rangesum_~i~1 < 10); 2360#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; 2363#L28-2 [2020-11-29 22:07:31,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:31,938 INFO L82 PathProgramCache]: Analyzing trace with hash -654604828, now seen corresponding path program 4 times [2020-11-29 22:07:31,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:31,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515010472] [2020-11-29 22:07:31,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:31,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:31,964 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:31,970 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:31,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:31,970 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 16 times [2020-11-29 22:07:31,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:31,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307783679] [2020-11-29 22:07:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:31,973 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:31,975 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:31,977 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:31,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:31,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2114090750, now seen corresponding path program 5 times [2020-11-29 22:07:31,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:31,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679068712] [2020-11-29 22:07:31,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 22:07:32,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679068712] [2020-11-29 22:07:32,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456885670] [2020-11-29 22:07:32,087 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:32,186 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2020-11-29 22:07:32,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:07:32,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-29 22:07:32,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-29 22:07:32,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:07:32,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-11-29 22:07:32,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9272085] [2020-11-29 22:07:32,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:32,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 22:07:32,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:07:32,300 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. cyclomatic complexity: 14 Second operand 9 states. [2020-11-29 22:07:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:32,430 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2020-11-29 22:07:32,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 22:07:32,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 103 transitions. [2020-11-29 22:07:32,431 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-11-29 22:07:32,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 103 transitions. [2020-11-29 22:07:32,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2020-11-29 22:07:32,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2020-11-29 22:07:32,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 103 transitions. [2020-11-29 22:07:32,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 22:07:32,432 INFO L691 BuchiCegarLoop]: Abstraction has 94 states and 103 transitions. [2020-11-29 22:07:32,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 103 transitions. [2020-11-29 22:07:32,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2020-11-29 22:07:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-11-29 22:07:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2020-11-29 22:07:32,436 INFO L714 BuchiCegarLoop]: Abstraction has 91 states and 100 transitions. [2020-11-29 22:07:32,436 INFO L594 BuchiCegarLoop]: Abstraction has 91 states and 100 transitions. [2020-11-29 22:07:32,436 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-11-29 22:07:32,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 100 transitions. [2020-11-29 22:07:32,437 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:32,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:32,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:32,438 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 5, 1, 1, 1, 1] [2020-11-29 22:07:32,439 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:32,439 INFO L794 eck$LassoCheckResult]: Stem: 2664#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); 2661#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; 2662#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2639#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2640#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2666#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2689#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2688#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2687#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2686#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2685#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2684#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2683#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2682#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2681#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2680#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2679#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2678#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2677#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2676#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2674#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2668#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2667#L17-3 assume !(init_nondet_~i~0 < 10); 2641#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; 2642#L28-3 assume !!(rangesum_~i~1 < 10); 2713#L29 assume !(rangesum_~i~1 > 5); 2645#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2646#L28-3 assume !!(rangesum_~i~1 < 10); 2654#L29 assume !(rangesum_~i~1 > 5); 2655#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2712#L28-3 assume !!(rangesum_~i~1 < 10); 2711#L29 assume !(rangesum_~i~1 > 5); 2710#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2709#L28-3 assume !!(rangesum_~i~1 < 10); 2708#L29 assume !(rangesum_~i~1 > 5); 2707#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2706#L28-3 assume !!(rangesum_~i~1 < 10); 2705#L29 assume !(rangesum_~i~1 > 5); 2704#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2703#L28-3 assume !!(rangesum_~i~1 < 10); 2702#L29 assume !(rangesum_~i~1 > 5); 2673#L28-2 [2020-11-29 22:07:32,439 INFO L796 eck$LassoCheckResult]: Loop: 2673#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2669#L28-3 assume !!(rangesum_~i~1 < 10); 2670#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; 2673#L28-2 [2020-11-29 22:07:32,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:32,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2114090752, now seen corresponding path program 5 times [2020-11-29 22:07:32,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:32,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705286524] [2020-11-29 22:07:32,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:32,452 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:32,465 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:32,470 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:32,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:32,471 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 17 times [2020-11-29 22:07:32,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:32,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844239722] [2020-11-29 22:07:32,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:32,474 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:32,476 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:32,477 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:32,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:32,478 INFO L82 PathProgramCache]: Analyzing trace with hash -522805150, now seen corresponding path program 6 times [2020-11-29 22:07:32,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:32,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010523365] [2020-11-29 22:07:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:32,497 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:32,513 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:32,519 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:39,704 WARN L193 SmtUtils]: Spent 7.11 s on a formula simplification. DAG size of input: 296 DAG size of output: 207 [2020-11-29 22:07:42,322 WARN L193 SmtUtils]: Spent 2.60 s on a formula simplification that was a NOOP. DAG size: 123 [2020-11-29 22:07:42,325 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 22:07:42,325 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 22:07:42,325 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 22:07:42,325 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 22:07:42,325 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 22:07:42,325 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:42,325 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 22:07:42,326 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 22:07:42,326 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration18_Lasso [2020-11-29 22:07:42,326 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 22:07:42,326 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 22:07:42,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,369 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2020-11-29 22:07:43,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:43,855 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 22:07:43,855 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:43,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:07:43,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:07:43,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:07:43,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:07:43,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:07:43,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:07:43,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:07:43,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:43,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:07:43,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:07:43,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:07:43,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:07:43,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:07:43,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:07:43,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:07:43,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:43,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:07:43,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:07:43,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:07:43,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:07:43,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:07:43,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:07:43,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:07:43,951 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:43,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:07:43,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:07:43,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:07:43,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:07:43,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:07:43,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:07:43,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:07:43,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:44,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:07:44,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:07:44,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:07:44,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:07:44,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:07:44,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:07:44,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:07:44,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:44,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:07:44,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:07:44,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:07:44,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:07:44,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:07:44,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:07:44,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:07:44,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:44,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:07:44,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:07:44,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:07:44,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:07:44,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:07:44,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 22:07:44,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 22:07:44,106 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 22:07:44,138 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-11-29 22:07:44,138 INFO L444 ModelExtractionUtils]: 12 out of 28 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:07:44,140 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:44,143 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 22:07:44,143 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 22:07:44,143 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 17 Supporting invariants [] [2020-11-29 22:07:44,242 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-11-29 22:07:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:44,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 22:07:44,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:44,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 22:07:44,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:44,407 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 [2020-11-29 22:07:44,407 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 100 transitions. cyclomatic complexity: 14 Second operand 4 states. [2020-11-29 22:07:44,482 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 100 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 104 states and 116 transitions. Complement of second has 7 states. [2020-11-29 22:07:44,487 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 [2020-11-29 22:07:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-11-29 22:07:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-11-29 22:07:44,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 41 letters. Loop has 3 letters. [2020-11-29 22:07:44,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:07:44,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 44 letters. Loop has 3 letters. [2020-11-29 22:07:44,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:07:44,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 41 letters. Loop has 6 letters. [2020-11-29 22:07:44,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:07:44,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 116 transitions. [2020-11-29 22:07:44,492 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-11-29 22:07:44,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 93 states and 104 transitions. [2020-11-29 22:07:44,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2020-11-29 22:07:44,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-11-29 22:07:44,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 104 transitions. [2020-11-29 22:07:44,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 22:07:44,495 INFO L691 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2020-11-29 22:07:44,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 104 transitions. [2020-11-29 22:07:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-11-29 22:07:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-29 22:07:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2020-11-29 22:07:44,499 INFO L714 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2020-11-29 22:07:44,499 INFO L594 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2020-11-29 22:07:44,499 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-11-29 22:07:44,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 104 transitions. [2020-11-29 22:07:44,501 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-11-29 22:07:44,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:44,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:44,502 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:07:44,502 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:44,503 INFO L794 eck$LassoCheckResult]: Stem: 3063#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); 3060#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; 3061#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3037#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3038#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3065#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3096#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3095#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3094#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3092#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3091#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3089#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3087#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3085#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3083#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3081#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3079#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3076#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3072#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3070#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3068#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3067#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3066#L17-3 assume !(init_nondet_~i~0 < 10); 3039#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; 3040#L28-3 assume !!(rangesum_~i~1 < 10); 3052#L29 assume !(rangesum_~i~1 > 5); 3041#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3042#L28-3 assume !!(rangesum_~i~1 < 10); 3093#L29 assume !(rangesum_~i~1 > 5); 3043#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3044#L28-3 assume !!(rangesum_~i~1 < 10); 3053#L29 assume !(rangesum_~i~1 > 5); 3054#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3090#L28-3 assume !!(rangesum_~i~1 < 10); 3088#L29 assume !(rangesum_~i~1 > 5); 3086#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3084#L28-3 assume !!(rangesum_~i~1 < 10); 3082#L29 assume !(rangesum_~i~1 > 5); 3080#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3078#L28-3 assume !!(rangesum_~i~1 < 10); 3075#L29 assume !(rangesum_~i~1 > 5); 3071#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3069#L28-3 assume !(rangesum_~i~1 < 10); 3064#L28-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 3045#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; 3046#L28-8 assume !!(rangesum_~i~1 < 10); 3111#L29-2 assume !(rangesum_~i~1 > 5); 3062#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3059#L28-8 assume !!(rangesum_~i~1 < 10); 3049#L29-2 assume !(rangesum_~i~1 > 5); 3050#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3110#L28-8 assume !!(rangesum_~i~1 < 10); 3109#L29-2 assume !(rangesum_~i~1 > 5); 3108#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3107#L28-8 assume !!(rangesum_~i~1 < 10); 3106#L29-2 assume !(rangesum_~i~1 > 5); 3105#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3104#L28-8 assume !!(rangesum_~i~1 < 10); 3103#L29-2 assume !(rangesum_~i~1 > 5); 3102#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3101#L28-8 assume !!(rangesum_~i~1 < 10); 3100#L29-2 assume !(rangesum_~i~1 > 5); 3099#L28-7 [2020-11-29 22:07:44,503 INFO L796 eck$LassoCheckResult]: Loop: 3099#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3097#L28-8 assume !!(rangesum_~i~1 < 10); 3098#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; 3099#L28-7 [2020-11-29 22:07:44,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:44,504 INFO L82 PathProgramCache]: Analyzing trace with hash -365260545, now seen corresponding path program 1 times [2020-11-29 22:07:44,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:44,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158552393] [2020-11-29 22:07:44,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-11-29 22:07:44,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158552393] [2020-11-29 22:07:44,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:07:44,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 22:07:44,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158908977] [2020-11-29 22:07:44,583 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:07:44,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:44,584 INFO L82 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2020-11-29 22:07:44,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:44,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848443594] [2020-11-29 22:07:44,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:44,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:44,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:44,591 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:44,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:44,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 22:07:44,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 22:07:44,673 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. cyclomatic complexity: 16 Second operand 4 states. [2020-11-29 22:07:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:44,771 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2020-11-29 22:07:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 22:07:44,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 123 transitions. [2020-11-29 22:07:44,773 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2020-11-29 22:07:44,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 106 states and 119 transitions. [2020-11-29 22:07:44,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2020-11-29 22:07:44,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2020-11-29 22:07:44,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 119 transitions. [2020-11-29 22:07:44,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 22:07:44,775 INFO L691 BuchiCegarLoop]: Abstraction has 106 states and 119 transitions. [2020-11-29 22:07:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 119 transitions. [2020-11-29 22:07:44,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2020-11-29 22:07:44,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-29 22:07:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2020-11-29 22:07:44,777 INFO L714 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2020-11-29 22:07:44,777 INFO L594 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2020-11-29 22:07:44,777 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-11-29 22:07:44,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 104 transitions. [2020-11-29 22:07:44,778 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-11-29 22:07:44,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:44,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:44,784 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:07:44,785 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:44,785 INFO L794 eck$LassoCheckResult]: Stem: 3270#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); 3267#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 3268#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3243#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3244#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3272#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3294#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3293#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3292#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3291#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3290#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3289#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3288#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3287#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3286#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3284#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3281#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3280#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3279#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3277#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3275#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3274#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3273#L17-3 assume !(init_nondet_~i~0 < 10); 3245#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; 3246#L28-3 assume !!(rangesum_~i~1 < 10); 3260#L29 assume !(rangesum_~i~1 > 5); 3249#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3250#L28-3 assume !!(rangesum_~i~1 < 10); 3321#L29 assume !(rangesum_~i~1 > 5); 3251#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3252#L28-3 assume !!(rangesum_~i~1 < 10); 3261#L29 assume !(rangesum_~i~1 > 5); 3262#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3320#L28-3 assume !!(rangesum_~i~1 < 10); 3319#L29 assume !(rangesum_~i~1 > 5); 3318#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3317#L28-3 assume !!(rangesum_~i~1 < 10); 3316#L29 assume !(rangesum_~i~1 > 5); 3315#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3314#L28-3 assume !!(rangesum_~i~1 < 10); 3313#L29 assume !(rangesum_~i~1 > 5); 3296#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3297#L28-3 assume !!(rangesum_~i~1 < 10); 3295#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; 3278#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3276#L28-3 assume !(rangesum_~i~1 < 10); 3271#L28-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 3253#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; 3254#L28-8 assume !!(rangesum_~i~1 < 10); 3257#L29-2 assume !(rangesum_~i~1 > 5); 3258#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3269#L28-8 assume !!(rangesum_~i~1 < 10); 3312#L29-2 assume !(rangesum_~i~1 > 5); 3311#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3310#L28-8 assume !!(rangesum_~i~1 < 10); 3309#L29-2 assume !(rangesum_~i~1 > 5); 3308#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3307#L28-8 assume !!(rangesum_~i~1 < 10); 3306#L29-2 assume !(rangesum_~i~1 > 5); 3305#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3304#L28-8 assume !!(rangesum_~i~1 < 10); 3303#L29-2 assume !(rangesum_~i~1 > 5); 3302#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3301#L28-8 assume !!(rangesum_~i~1 < 10); 3300#L29-2 assume !(rangesum_~i~1 > 5); 3298#L28-7 [2020-11-29 22:07:44,785 INFO L796 eck$LassoCheckResult]: Loop: 3298#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3299#L28-8 assume !!(rangesum_~i~1 < 10); 3283#L29-2 assume !(rangesum_~i~1 > 5); 3298#L28-7 [2020-11-29 22:07:44,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:44,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1039890653, now seen corresponding path program 1 times [2020-11-29 22:07:44,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:44,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163217750] [2020-11-29 22:07:44,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2020-11-29 22:07:44,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163217750] [2020-11-29 22:07:44,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729013734] [2020-11-29 22:07:44,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:44,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 22:07:44,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2020-11-29 22:07:44,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-29 22:07:44,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-11-29 22:07:44,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420241049] [2020-11-29 22:07:44,990 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:07:44,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:44,991 INFO L82 PathProgramCache]: Analyzing trace with hash 85180, now seen corresponding path program 1 times [2020-11-29 22:07:44,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:44,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084573266] [2020-11-29 22:07:44,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:44,996 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:44,997 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:45,000 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:45,032 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 22:07:45,032 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 22:07:45,032 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 22:07:45,032 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 22:07:45,032 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-29 22:07:45,032 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:45,033 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 22:07:45,033 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 22:07:45,033 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration20_Loop [2020-11-29 22:07:45,033 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 22:07:45,033 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 22:07:45,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:45,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:45,065 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 22:07:45,065 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:45,068 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-29 22:07:45,069 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:45,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-29 22:07:45,093 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-29 22:07:45,160 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-29 22:07:45,161 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 22:07:45,161 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 22:07:45,161 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 22:07:45,161 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 22:07:45,161 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 22:07:45,161 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:45,162 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 22:07:45,162 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 22:07:45,162 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration20_Loop [2020-11-29 22:07:45,162 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 22:07:45,162 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 22:07:45,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:45,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 22:07:45,202 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 22:07:45,202 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:45,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-29 22:07:45,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 22:07:45,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 22:07:45,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 22:07:45,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 22:07:45,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 22:07:45,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 22:07:45,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 22:07:45,210 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 22:07:45,212 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-29 22:07:45,212 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 22:07:45,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 22:07:45,214 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-29 22:07:45,214 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 22:07:45,214 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 9 Supporting invariants [] Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 22:07:45,237 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-29 22:07:45,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:45,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 22:07:45,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:45,314 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 22:07:45,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:07:45,360 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 [2020-11-29 22:07:45,360 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 104 transitions. cyclomatic complexity: 14 Second operand 3 states. [2020-11-29 22:07:45,420 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 104 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 114 states and 126 transitions. Complement of second has 5 states. [2020-11-29 22:07:45,436 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 [2020-11-29 22:07:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-29 22:07:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-11-29 22:07:45,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 65 letters. Loop has 3 letters. [2020-11-29 22:07:45,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:07:45,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 68 letters. Loop has 3 letters. [2020-11-29 22:07:45,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:07:45,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 65 letters. Loop has 6 letters. [2020-11-29 22:07:45,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 22:07:45,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2020-11-29 22:07:45,440 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-11-29 22:07:45,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 99 states and 109 transitions. [2020-11-29 22:07:45,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2020-11-29 22:07:45,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2020-11-29 22:07:45,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 109 transitions. [2020-11-29 22:07:45,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 22:07:45,441 INFO L691 BuchiCegarLoop]: Abstraction has 99 states and 109 transitions. [2020-11-29 22:07:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 109 transitions. [2020-11-29 22:07:45,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2020-11-29 22:07:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-11-29 22:07:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2020-11-29 22:07:45,443 INFO L714 BuchiCegarLoop]: Abstraction has 98 states and 108 transitions. [2020-11-29 22:07:45,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:45,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 22:07:45,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 22:07:45,444 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 4 states. [2020-11-29 22:07:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:45,501 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2020-11-29 22:07:45,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 22:07:45,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 122 transitions. [2020-11-29 22:07:45,502 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-11-29 22:07:45,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 109 states and 122 transitions. [2020-11-29 22:07:45,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2020-11-29 22:07:45,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2020-11-29 22:07:45,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 122 transitions. [2020-11-29 22:07:45,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 22:07:45,504 INFO L691 BuchiCegarLoop]: Abstraction has 109 states and 122 transitions. [2020-11-29 22:07:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 122 transitions. [2020-11-29 22:07:45,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2020-11-29 22:07:45,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-11-29 22:07:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2020-11-29 22:07:45,507 INFO L714 BuchiCegarLoop]: Abstraction has 98 states and 106 transitions. [2020-11-29 22:07:45,507 INFO L594 BuchiCegarLoop]: Abstraction has 98 states and 106 transitions. [2020-11-29 22:07:45,507 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-11-29 22:07:45,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 106 transitions. [2020-11-29 22:07:45,508 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-11-29 22:07:45,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:45,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:45,509 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:07:45,509 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:45,510 INFO L794 eck$LassoCheckResult]: Stem: 4109#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); 4106#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; 4107#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4077#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4078#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4111#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4135#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4134#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4133#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4132#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4131#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4130#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4129#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4128#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4127#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4126#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4125#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4122#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4121#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4120#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4119#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4115#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4114#L17-3 assume !(init_nondet_~i~0 < 10); 4079#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; 4080#L28-3 assume !!(rangesum_~i~1 < 10); 4096#L29 assume !(rangesum_~i~1 > 5); 4083#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4084#L28-3 assume !!(rangesum_~i~1 < 10); 4113#L29 assume !(rangesum_~i~1 > 5); 4085#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4086#L28-3 assume !!(rangesum_~i~1 < 10); 4097#L29 assume !(rangesum_~i~1 > 5); 4098#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4147#L28-3 assume !!(rangesum_~i~1 < 10); 4146#L29 assume !(rangesum_~i~1 > 5); 4145#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4144#L28-3 assume !!(rangesum_~i~1 < 10); 4143#L29 assume !(rangesum_~i~1 > 5); 4142#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4141#L28-3 assume !!(rangesum_~i~1 < 10); 4140#L29 assume !(rangesum_~i~1 > 5); 4124#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4136#L28-3 assume !!(rangesum_~i~1 < 10); 4123#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; 4117#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4112#L28-3 assume !(rangesum_~i~1 < 10); 4110#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); 4087#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; 4088#L28-8 assume !!(rangesum_~i~1 < 10); 4091#L29-2 assume !(rangesum_~i~1 > 5); 4092#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4105#L28-8 assume !!(rangesum_~i~1 < 10); 4093#L29-2 assume !(rangesum_~i~1 > 5); 4094#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4108#L28-8 assume !!(rangesum_~i~1 < 10); 4158#L29-2 assume !(rangesum_~i~1 > 5); 4157#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4156#L28-8 assume !!(rangesum_~i~1 < 10); 4155#L29-2 assume !(rangesum_~i~1 > 5); 4154#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4153#L28-8 assume !!(rangesum_~i~1 < 10); 4150#L29-2 assume !(rangesum_~i~1 > 5); 4151#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4152#L28-8 assume !!(rangesum_~i~1 < 10); 4139#L29-2 assume !(rangesum_~i~1 > 5); 4137#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4103#L28-8 assume !!(rangesum_~i~1 < 10); 4104#L29-2 [2020-11-29 22:07:45,510 INFO L796 eck$LassoCheckResult]: Loop: 4104#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; 4118#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4116#L28-8 assume !!(rangesum_~i~1 < 10); 4104#L29-2 [2020-11-29 22:07:45,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:45,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1815162476, now seen corresponding path program 1 times [2020-11-29 22:07:45,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:45,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308869766] [2020-11-29 22:07:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:45,522 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 22:07:45,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582862376] [2020-11-29 22:07:45,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:45,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 22:07:45,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-11-29 22:07:45,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308869766] [2020-11-29 22:07:45,805 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 22:07:45,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582862376] [2020-11-29 22:07:45,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-29 22:07:45,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-29 22:07:45,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863598835] [2020-11-29 22:07:45,806 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:07:45,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:45,806 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 2 times [2020-11-29 22:07:45,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:45,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195159593] [2020-11-29 22:07:45,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:45,810 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:45,812 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:45,813 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:45,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:45,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 22:07:45,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-11-29 22:07:45,878 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. cyclomatic complexity: 14 Second operand 10 states. [2020-11-29 22:07:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:46,124 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2020-11-29 22:07:46,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 22:07:46,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 141 transitions. [2020-11-29 22:07:46,125 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-11-29 22:07:46,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 124 states and 139 transitions. [2020-11-29 22:07:46,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2020-11-29 22:07:46,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-11-29 22:07:46,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 139 transitions. [2020-11-29 22:07:46,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 22:07:46,129 INFO L691 BuchiCegarLoop]: Abstraction has 124 states and 139 transitions. [2020-11-29 22:07:46,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 139 transitions. [2020-11-29 22:07:46,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 104. [2020-11-29 22:07:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-29 22:07:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2020-11-29 22:07:46,133 INFO L714 BuchiCegarLoop]: Abstraction has 104 states and 113 transitions. [2020-11-29 22:07:46,133 INFO L594 BuchiCegarLoop]: Abstraction has 104 states and 113 transitions. [2020-11-29 22:07:46,133 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-11-29 22:07:46,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 113 transitions. [2020-11-29 22:07:46,134 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-11-29 22:07:46,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:46,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:46,135 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:07:46,136 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:46,136 INFO L794 eck$LassoCheckResult]: Stem: 4546#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); 4541#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; 4542#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4512#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4513#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4548#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4569#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4568#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4567#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4566#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4565#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4564#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4563#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4562#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4561#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4560#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4559#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4558#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4557#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4556#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4555#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4552#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4551#L17-3 assume !(init_nondet_~i~0 < 10); 4514#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; 4515#L28-3 assume !!(rangesum_~i~1 < 10); 4531#L29 assume !(rangesum_~i~1 > 5); 4518#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4519#L28-3 assume !!(rangesum_~i~1 < 10); 4550#L29 assume !(rangesum_~i~1 > 5); 4520#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4521#L28-3 assume !!(rangesum_~i~1 < 10); 4532#L29 assume !(rangesum_~i~1 > 5); 4533#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4589#L28-3 assume !!(rangesum_~i~1 < 10); 4588#L29 assume !(rangesum_~i~1 > 5); 4587#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4586#L28-3 assume !!(rangesum_~i~1 < 10); 4585#L29 assume !(rangesum_~i~1 > 5); 4584#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4583#L28-3 assume !!(rangesum_~i~1 < 10); 4582#L29 assume !(rangesum_~i~1 > 5); 4575#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4581#L28-3 assume !!(rangesum_~i~1 < 10); 4580#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; 4574#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4579#L28-3 assume !!(rangesum_~i~1 < 10); 4573#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; 4554#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4549#L28-3 assume !(rangesum_~i~1 < 10); 4547#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); 4522#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; 4523#L28-8 assume !!(rangesum_~i~1 < 10); 4572#L29-2 assume !(rangesum_~i~1 > 5); 4543#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4544#L28-8 assume !!(rangesum_~i~1 < 10); 4590#L29-2 assume !(rangesum_~i~1 > 5); 4591#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4592#L28-8 assume !!(rangesum_~i~1 < 10); 4593#L29-2 assume !(rangesum_~i~1 > 5); 4594#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4598#L28-8 assume !!(rangesum_~i~1 < 10); 4597#L29-2 assume !(rangesum_~i~1 > 5); 4596#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4595#L28-8 assume !!(rangesum_~i~1 < 10); 4528#L29-2 assume !(rangesum_~i~1 > 5); 4529#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4599#L28-8 assume !!(rangesum_~i~1 < 10); 4578#L29-2 assume !(rangesum_~i~1 > 5); 4577#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4576#L28-8 assume !!(rangesum_~i~1 < 10); 4570#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; 4571#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4538#L28-8 assume !!(rangesum_~i~1 < 10); 4526#L29-2 [2020-11-29 22:07:46,136 INFO L796 eck$LassoCheckResult]: Loop: 4526#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4527#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4553#L28-8 assume !!(rangesum_~i~1 < 10); 4526#L29-2 [2020-11-29 22:07:46,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:46,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2012858871, now seen corresponding path program 1 times [2020-11-29 22:07:46,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:46,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939505633] [2020-11-29 22:07:46,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:46,147 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 22:07:46,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1232069410] [2020-11-29 22:07:46,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:07:46,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 22:07:46,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2020-11-29 22:07:46,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939505633] [2020-11-29 22:07:46,344 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 22:07:46,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232069410] [2020-11-29 22:07:46,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-29 22:07:46,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-29 22:07:46,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941147749] [2020-11-29 22:07:46,344 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:07:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:46,345 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 3 times [2020-11-29 22:07:46,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:46,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388447828] [2020-11-29 22:07:46,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:46,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:46,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:46,348 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:46,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:46,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 22:07:46,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-11-29 22:07:46,417 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. cyclomatic complexity: 15 Second operand 11 states. [2020-11-29 22:07:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:46,735 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2020-11-29 22:07:46,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-29 22:07:46,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 156 transitions. [2020-11-29 22:07:46,737 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2020-11-29 22:07:46,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 136 states and 154 transitions. [2020-11-29 22:07:46,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2020-11-29 22:07:46,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2020-11-29 22:07:46,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 154 transitions. [2020-11-29 22:07:46,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 22:07:46,739 INFO L691 BuchiCegarLoop]: Abstraction has 136 states and 154 transitions. [2020-11-29 22:07:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 154 transitions. [2020-11-29 22:07:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2020-11-29 22:07:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-29 22:07:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2020-11-29 22:07:46,742 INFO L714 BuchiCegarLoop]: Abstraction has 110 states and 120 transitions. [2020-11-29 22:07:46,742 INFO L594 BuchiCegarLoop]: Abstraction has 110 states and 120 transitions. [2020-11-29 22:07:46,742 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-11-29 22:07:46,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 120 transitions. [2020-11-29 22:07:46,743 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-11-29 22:07:46,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:46,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:46,744 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 8, 6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:07:46,744 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:46,744 INFO L794 eck$LassoCheckResult]: Stem: 5016#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); 5012#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; 5013#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4984#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4985#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5018#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5042#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5041#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5040#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5039#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5038#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5037#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5036#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5035#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5034#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5033#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5032#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5031#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5030#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5029#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5028#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5023#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5022#L17-3 assume !(init_nondet_~i~0 < 10); 4986#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; 4987#L28-3 assume !!(rangesum_~i~1 < 10); 5003#L29 assume !(rangesum_~i~1 > 5); 4990#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4991#L28-3 assume !!(rangesum_~i~1 < 10); 5069#L29 assume !(rangesum_~i~1 > 5); 4992#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4993#L28-3 assume !!(rangesum_~i~1 < 10); 5004#L29 assume !(rangesum_~i~1 > 5); 5005#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5068#L28-3 assume !!(rangesum_~i~1 < 10); 5067#L29 assume !(rangesum_~i~1 > 5); 5066#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5065#L28-3 assume !!(rangesum_~i~1 < 10); 5064#L29 assume !(rangesum_~i~1 > 5); 5063#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5062#L28-3 assume !!(rangesum_~i~1 < 10); 5061#L29 assume !(rangesum_~i~1 > 5); 5045#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5060#L28-3 assume !!(rangesum_~i~1 < 10); 5059#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; 5058#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5057#L28-3 assume !!(rangesum_~i~1 < 10); 5056#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; 5044#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5051#L28-3 assume !!(rangesum_~i~1 < 10); 5043#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; 5026#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5019#L28-3 assume !(rangesum_~i~1 < 10); 5017#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); 4994#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; 4995#L28-8 assume !!(rangesum_~i~1 < 10); 4998#L29-2 assume !(rangesum_~i~1 > 5); 4999#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5014#L28-8 assume !!(rangesum_~i~1 < 10); 5073#L29-2 assume !(rangesum_~i~1 > 5); 5072#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5070#L28-8 assume !!(rangesum_~i~1 < 10); 5071#L29-2 assume !(rangesum_~i~1 > 5); 5078#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5077#L28-8 assume !!(rangesum_~i~1 < 10); 5076#L29-2 assume !(rangesum_~i~1 > 5); 5075#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5074#L28-8 assume !!(rangesum_~i~1 < 10); 5000#L29-2 assume !(rangesum_~i~1 > 5); 5001#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5079#L28-8 assume !!(rangesum_~i~1 < 10); 5055#L29-2 assume !(rangesum_~i~1 > 5); 5054#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5053#L28-8 assume !!(rangesum_~i~1 < 10); 5052#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; 5050#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5049#L28-8 assume !!(rangesum_~i~1 < 10); 5048#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; 5047#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5046#L28-8 assume !!(rangesum_~i~1 < 10); 5025#L29-2 [2020-11-29 22:07:46,744 INFO L796 eck$LassoCheckResult]: Loop: 5025#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; 5027#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5024#L28-8 assume !!(rangesum_~i~1 < 10); 5025#L29-2 [2020-11-29 22:07:46,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:46,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1646097460, now seen corresponding path program 2 times [2020-11-29 22:07:46,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:46,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764714101] [2020-11-29 22:07:46,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:46,769 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 22:07:46,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [292682475] [2020-11-29 22:07:46,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:46,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 22:07:46,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:07:46,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-29 22:07:46,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2020-11-29 22:07:47,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764714101] [2020-11-29 22:07:47,011 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 22:07:47,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292682475] [2020-11-29 22:07:47,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-29 22:07:47,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-29 22:07:47,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179944958] [2020-11-29 22:07:47,012 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 22:07:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:47,013 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 4 times [2020-11-29 22:07:47,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:47,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160061981] [2020-11-29 22:07:47,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:47,016 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:47,018 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:47,019 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:47,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:47,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 22:07:47,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:07:47,082 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. cyclomatic complexity: 16 Second operand 12 states. [2020-11-29 22:07:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:47,368 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2020-11-29 22:07:47,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 22:07:47,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 158 transitions. [2020-11-29 22:07:47,369 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2020-11-29 22:07:47,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 156 transitions. [2020-11-29 22:07:47,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2020-11-29 22:07:47,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2020-11-29 22:07:47,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 156 transitions. [2020-11-29 22:07:47,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 22:07:47,371 INFO L691 BuchiCegarLoop]: Abstraction has 139 states and 156 transitions. [2020-11-29 22:07:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 156 transitions. [2020-11-29 22:07:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2020-11-29 22:07:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-11-29 22:07:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2020-11-29 22:07:47,374 INFO L714 BuchiCegarLoop]: Abstraction has 116 states and 127 transitions. [2020-11-29 22:07:47,374 INFO L594 BuchiCegarLoop]: Abstraction has 116 states and 127 transitions. [2020-11-29 22:07:47,374 INFO L427 BuchiCegarLoop]: ======== Iteration 24============ [2020-11-29 22:07:47,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 127 transitions. [2020-11-29 22:07:47,375 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-11-29 22:07:47,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:47,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:47,376 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:07:47,376 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 22:07:47,377 INFO L794 eck$LassoCheckResult]: Stem: 5516#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); 5512#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; 5513#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5486#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5487#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5518#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5558#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5557#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5556#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5555#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5553#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5551#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5549#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5547#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5545#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5543#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5541#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5539#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5537#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5535#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5533#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5523#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5522#L17-3 assume !(init_nondet_~i~0 < 10); 5488#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; 5489#L28-3 assume !!(rangesum_~i~1 < 10); 5503#L29 assume !(rangesum_~i~1 > 5); 5490#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5491#L28-3 assume !!(rangesum_~i~1 < 10); 5575#L29 assume !(rangesum_~i~1 > 5); 5492#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5493#L28-3 assume !!(rangesum_~i~1 < 10); 5504#L29 assume !(rangesum_~i~1 > 5); 5505#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5574#L28-3 assume !!(rangesum_~i~1 < 10); 5573#L29 assume !(rangesum_~i~1 > 5); 5572#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5571#L28-3 assume !!(rangesum_~i~1 < 10); 5570#L29 assume !(rangesum_~i~1 > 5); 5569#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5568#L28-3 assume !!(rangesum_~i~1 < 10); 5567#L29 assume !(rangesum_~i~1 > 5); 5530#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5566#L28-3 assume !!(rangesum_~i~1 < 10); 5565#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; 5564#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5563#L28-3 assume !!(rangesum_~i~1 < 10); 5562#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; 5561#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5560#L28-3 assume !!(rangesum_~i~1 < 10); 5559#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; 5529#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5531#L28-3 assume !!(rangesum_~i~1 < 10); 5528#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; 5526#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5519#L28-3 assume !(rangesum_~i~1 < 10); 5517#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); 5494#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; 5495#L28-8 assume !!(rangesum_~i~1 < 10); 5498#L29-2 assume !(rangesum_~i~1 > 5); 5499#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5514#L28-8 assume !!(rangesum_~i~1 < 10); 5576#L29-2 assume !(rangesum_~i~1 > 5); 5577#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5578#L28-8 assume !!(rangesum_~i~1 < 10); 5579#L29-2 assume !(rangesum_~i~1 > 5); 5580#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5584#L28-8 assume !!(rangesum_~i~1 < 10); 5583#L29-2 assume !(rangesum_~i~1 > 5); 5582#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5581#L28-8 assume !!(rangesum_~i~1 < 10); 5500#L29-2 assume !(rangesum_~i~1 > 5); 5501#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5585#L28-8 assume !!(rangesum_~i~1 < 10); 5554#L29-2 assume !(rangesum_~i~1 > 5); 5552#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5550#L28-8 assume !!(rangesum_~i~1 < 10); 5548#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; 5546#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5544#L28-8 assume !!(rangesum_~i~1 < 10); 5542#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; 5540#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5538#L28-8 assume !!(rangesum_~i~1 < 10); 5536#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; 5534#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5532#L28-8 assume !!(rangesum_~i~1 < 10); 5525#L29-2 [2020-11-29 22:07:47,377 INFO L796 eck$LassoCheckResult]: Loop: 5525#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; 5527#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5524#L28-8 assume !!(rangesum_~i~1 < 10); 5525#L29-2 [2020-11-29 22:07:47,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:47,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1484601769, now seen corresponding path program 3 times [2020-11-29 22:07:47,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:47,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122387857] [2020-11-29 22:07:47,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:47,388 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 22:07:47,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301544712] [2020-11-29 22:07:47,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:47,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2020-11-29 22:07:47,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-11-29 22:07:47,627 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:47,683 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:47,719 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:47,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:47,720 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 5 times [2020-11-29 22:07:47,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:47,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385859596] [2020-11-29 22:07:47,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:47,723 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:47,725 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:47,726 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:47,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1801965686, now seen corresponding path program 4 times [2020-11-29 22:07:47,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:47,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045796242] [2020-11-29 22:07:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:47,737 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 22:07:47,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328594773] [2020-11-29 22:07:47,737 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:47,834 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 22:07:47,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:07:47,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 22:07:47,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:07:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2020-11-29 22:07:47,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045796242] [2020-11-29 22:07:47,958 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-29 22:07:47,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328594773] [2020-11-29 22:07:47,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:07:47,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 22:07:47,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054035498] [2020-11-29 22:07:48,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:07:48,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 22:07:48,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-11-29 22:07:48,078 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. cyclomatic complexity: 17 Second operand 7 states. [2020-11-29 22:07:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:07:48,316 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2020-11-29 22:07:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 22:07:48,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 143 transitions. [2020-11-29 22:07:48,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-11-29 22:07:48,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 115 states and 119 transitions. [2020-11-29 22:07:48,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-11-29 22:07:48,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2020-11-29 22:07:48,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 119 transitions. [2020-11-29 22:07:48,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 22:07:48,320 INFO L691 BuchiCegarLoop]: Abstraction has 115 states and 119 transitions. [2020-11-29 22:07:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 119 transitions. [2020-11-29 22:07:48,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2020-11-29 22:07:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-11-29 22:07:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2020-11-29 22:07:48,323 INFO L714 BuchiCegarLoop]: Abstraction has 96 states and 100 transitions. [2020-11-29 22:07:48,323 INFO L594 BuchiCegarLoop]: Abstraction has 96 states and 100 transitions. [2020-11-29 22:07:48,323 INFO L427 BuchiCegarLoop]: ======== Iteration 25============ [2020-11-29 22:07:48,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 100 transitions. [2020-11-29 22:07:48,324 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-11-29 22:07:48,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 22:07:48,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 22:07:48,326 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:07:48,326 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-29 22:07:48,326 INFO L794 eck$LassoCheckResult]: Stem: 6043#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); 6038#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; 6039#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6012#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6013#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6045#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6097#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6095#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6093#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6091#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6089#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6087#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6085#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6084#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6082#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6079#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6077#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6075#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6072#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6070#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6069#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6050#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6049#L17-3 assume !(init_nondet_~i~0 < 10); 6014#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; 6015#L28-3 assume !!(rangesum_~i~1 < 10); 6030#L29 assume !(rangesum_~i~1 > 5); 6018#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6019#L28-3 assume !!(rangesum_~i~1 < 10); 6031#L29 assume !(rangesum_~i~1 > 5); 6020#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6021#L28-3 assume !!(rangesum_~i~1 < 10); 6048#L29 assume !(rangesum_~i~1 > 5); 6100#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6099#L28-3 assume !!(rangesum_~i~1 < 10); 6098#L29 assume !(rangesum_~i~1 > 5); 6096#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6094#L28-3 assume !!(rangesum_~i~1 < 10); 6092#L29 assume !(rangesum_~i~1 > 5); 6090#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6088#L28-3 assume !!(rangesum_~i~1 < 10); 6086#L29 assume !(rangesum_~i~1 > 5); 6081#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6083#L28-3 assume !!(rangesum_~i~1 < 10); 6080#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; 6078#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6046#L28-3 assume !!(rangesum_~i~1 < 10); 6047#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; 6065#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6063#L28-3 assume !!(rangesum_~i~1 < 10); 6061#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; 6059#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6057#L28-3 assume !!(rangesum_~i~1 < 10); 6055#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; 6053#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6051#L28-3 assume !(rangesum_~i~1 < 10); 6044#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); 6022#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; 6023#L28-8 assume !!(rangesum_~i~1 < 10); 6036#L29-2 assume !(rangesum_~i~1 > 5); 6040#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6041#L28-8 assume !!(rangesum_~i~1 < 10); 6107#L29-2 assume !(rangesum_~i~1 > 5); 6042#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6037#L28-8 assume !!(rangesum_~i~1 < 10); 6027#L29-2 assume !(rangesum_~i~1 > 5); 6028#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6106#L28-8 assume !!(rangesum_~i~1 < 10); 6105#L29-2 assume !(rangesum_~i~1 > 5); 6104#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6103#L28-8 assume !!(rangesum_~i~1 < 10); 6102#L29-2 assume !(rangesum_~i~1 > 5); 6101#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6074#L28-8 assume !!(rangesum_~i~1 < 10); 6076#L29-2 assume !(rangesum_~i~1 > 5); 6073#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6071#L28-8 assume !!(rangesum_~i~1 < 10); 6025#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; 6026#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6068#L28-8 assume !!(rangesum_~i~1 < 10); 6067#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; 6066#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6064#L28-8 assume !!(rangesum_~i~1 < 10); 6062#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; 6060#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6058#L28-8 assume !!(rangesum_~i~1 < 10); 6056#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; 6054#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6052#L28-8 assume !(rangesum_~i~1 < 10); 6032#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); 6033#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; 6034#L54-3 [2020-11-29 22:07:48,335 INFO L796 eck$LassoCheckResult]: Loop: 6034#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; 6035#L54-2 main_#t~post12 := main_~i~2;main_~i~2 := 1 + main_#t~post12;havoc main_#t~post12; 6034#L54-3 [2020-11-29 22:07:48,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:48,336 INFO L82 PathProgramCache]: Analyzing trace with hash 817204024, now seen corresponding path program 1 times [2020-11-29 22:07:48,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:48,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451789269] [2020-11-29 22:07:48,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:48,346 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 22:07:48,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1794789725] [2020-11-29 22:07:48,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:48,499 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:48,583 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:48,620 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:48,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:48,621 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2020-11-29 22:07:48,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:48,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753076960] [2020-11-29 22:07:48,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:48,624 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:48,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:48,626 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:48,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:07:48,627 INFO L82 PathProgramCache]: Analyzing trace with hash -645945734, now seen corresponding path program 1 times [2020-11-29 22:07:48,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:07:48,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121750416] [2020-11-29 22:07:48,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:07:48,638 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-11-29 22:07:48,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857819941] [2020-11-29 22:07:48,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_441b4b1a-c484-46ad-acfb-390e945a37f8/bin/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:07:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:48,805 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:07:49,025 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:07:49,068 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:07:49,234 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2020-11-29 22:10:25,211 WARN L193 SmtUtils]: Spent 2.60 m on a formula simplification. DAG size of input: 585 DAG size of output: 407 [2020-11-29 22:10:25,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:10:25,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:10:25,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:10:25,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:10:25,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:10:25,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:10:25,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:10:25,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:10:25,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:10:25,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:10:25,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:10:25,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:10:25,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:10:25,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:10:25,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:10:25,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:10:25,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:10:25,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:10:25,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:10:26,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:10:26,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:10:26,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:10:26,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:10:26,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:10:26,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:10:26,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:10:26,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:10:26,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:10:26,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:10:26,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:10:26,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:10:26,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:10:26,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:10:26,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:10:26,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:10:26,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:10:26,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:10:26,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:10:26,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:13:59,142 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2020-11-29 22:13:59,143 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:226) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition(TransFormulaUtils.java:255) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.SequentialComposition.getInterproceduralTransFormula(SequentialComposition.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.SequentialComposition.getInterproceduralTransFormula(SequentialComposition.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.computeTF(LassoCheck.java:362) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.computeStemTF(LassoCheck.java:326) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 35 more [2020-11-29 22:13:59,150 INFO L168 Benchmark]: Toolchain (without parser) took 396372.99 ms. Allocated memory was 81.8 MB in the beginning and 283.1 MB in the end (delta: 201.3 MB). Free memory was 49.3 MB in the beginning and 217.3 MB in the end (delta: -168.1 MB). Peak memory consumption was 189.6 MB. Max. memory is 16.1 GB. [2020-11-29 22:13:59,150 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 81.8 MB. Free memory was 54.5 MB in the beginning and 54.5 MB in the end (delta: 27.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 22:13:59,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.23 ms. Allocated memory was 81.8 MB in the beginning and 100.7 MB in the end (delta: 18.9 MB). Free memory was 49.1 MB in the beginning and 78.3 MB in the end (delta: -29.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-11-29 22:13:59,151 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.48 ms. Allocated memory is still 100.7 MB. Free memory was 78.3 MB in the beginning and 76.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 22:13:59,151 INFO L168 Benchmark]: Boogie Preprocessor took 53.37 ms. Allocated memory is still 100.7 MB. Free memory was 76.2 MB in the beginning and 74.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 22:13:59,151 INFO L168 Benchmark]: RCFGBuilder took 667.65 ms. Allocated memory is still 100.7 MB. Free memory was 74.7 MB in the beginning and 55.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-29 22:13:59,152 INFO L168 Benchmark]: BuchiAutomizer took 395216.73 ms. Allocated memory was 100.7 MB in the beginning and 283.1 MB in the end (delta: 182.5 MB). Free memory was 55.5 MB in the beginning and 217.3 MB in the end (delta: -161.8 MB). Peak memory consumption was 179.8 MB. Max. memory is 16.1 GB. [2020-11-29 22:13:59,153 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.23 ms. Allocated memory is still 81.8 MB. Free memory was 54.5 MB in the beginning and 54.5 MB in the end (delta: 27.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 353.23 ms. Allocated memory was 81.8 MB in the beginning and 100.7 MB in the end (delta: 18.9 MB). Free memory was 49.1 MB in the beginning and 78.3 MB in the end (delta: -29.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.48 ms. Allocated memory is still 100.7 MB. Free memory was 78.3 MB in the beginning and 76.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 53.37 ms. Allocated memory is still 100.7 MB. Free memory was 76.2 MB in the beginning and 74.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 667.65 ms. Allocated memory is still 100.7 MB. Free memory was 74.7 MB in the beginning and 55.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 395216.73 ms. Allocated memory was 100.7 MB in the beginning and 283.1 MB in the end (delta: 182.5 MB). Free memory was 55.5 MB in the beginning and 217.3 MB in the end (delta: -161.8 MB). Peak memory consumption was 179.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...