./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 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt --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_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/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: line 292273 column 376: unknown constant v_ULTIMATE.start_init_nondet_#t~nondet4_40 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:19:32,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:19:32,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:19:32,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:19:32,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:19:32,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:19:32,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:19:32,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:19:32,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:19:32,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:19:32,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:19:32,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:19:32,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:19:32,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:19:32,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:19:32,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:19:32,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:19:32,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:19:32,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:19:32,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:19:32,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:19:32,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:19:32,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:19:32,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:19:32,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:19:32,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:19:32,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:19:32,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:19:32,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:19:32,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:19:32,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:19:32,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:19:32,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:19:32,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:19:32,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:19:32,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:19:32,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:19:32,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:19:32,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:19:32,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:19:32,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:19:32,743 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-13 00:19:32,769 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:19:32,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:19:32,770 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:19:32,770 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:19:32,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:19:32,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:19:32,771 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:19:32,772 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-13 00:19:32,772 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-13 00:19:32,772 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-13 00:19:32,772 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-13 00:19:32,773 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-13 00:19:32,773 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-13 00:19:32,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:19:32,773 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:19:32,773 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 00:19:32,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:19:32,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:19:32,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:19:32,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-13 00:19:32,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-13 00:19:32,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-13 00:19:32,775 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:19:32,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:19:32,775 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-13 00:19:32,775 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:19:32,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-13 00:19:32,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:19:32,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:19:32,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:19:32,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:19:32,777 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:19:32,778 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-13 00:19:32,778 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_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/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_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c00c1225dae238bedea18c737f72ae44fea020a [2021-10-13 00:19:33,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:19:33,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:19:33,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:19:33,070 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:19:33,072 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:19:33,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/reducercommutativity/rangesum10.i [2021-10-13 00:19:33,150 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/data/21f496f48/f3ea7debe6d0493d8b793aac94b3e9d8/FLAG8d253980c [2021-10-13 00:19:33,648 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:19:33,649 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/sv-benchmarks/c/reducercommutativity/rangesum10.i [2021-10-13 00:19:33,656 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/data/21f496f48/f3ea7debe6d0493d8b793aac94b3e9d8/FLAG8d253980c [2021-10-13 00:19:34,016 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/data/21f496f48/f3ea7debe6d0493d8b793aac94b3e9d8 [2021-10-13 00:19:34,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:19:34,020 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:19:34,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:19:34,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:19:34,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:19:34,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:19:34" (1/1) ... [2021-10-13 00:19:34,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a12226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:34, skipping insertion in model container [2021-10-13 00:19:34,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:19:34" (1/1) ... [2021-10-13 00:19:34,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:19:34,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:19:34,269 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/sv-benchmarks/c/reducercommutativity/rangesum10.i[1465,1478] [2021-10-13 00:19:34,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:19:34,278 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:19:34,302 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/sv-benchmarks/c/reducercommutativity/rangesum10.i[1465,1478] [2021-10-13 00:19:34,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:19:34,318 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:19:34,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:34 WrapperNode [2021-10-13 00:19:34,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:19:34,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:19:34,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:19:34,321 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:19:34,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:34" (1/1) ... [2021-10-13 00:19:34,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:34" (1/1) ... [2021-10-13 00:19:34,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:19:34,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:19:34,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:19:34,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:19:34,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:34" (1/1) ... [2021-10-13 00:19:34,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:34" (1/1) ... [2021-10-13 00:19:34,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:34" (1/1) ... [2021-10-13 00:19:34,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:34" (1/1) ... [2021-10-13 00:19:34,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:34" (1/1) ... [2021-10-13 00:19:34,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:34" (1/1) ... [2021-10-13 00:19:34,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:34" (1/1) ... [2021-10-13 00:19:34,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:19:34,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:19:34,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:19:34,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:19:34,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:34" (1/1) ... [2021-10-13 00:19:34,462 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:34,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:34,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:34,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-13 00:19:34,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:19:34,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:19:34,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 00:19:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:19:34,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:19:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 00:19:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 00:19:34,909 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:19:34,909 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-10-13 00:19:34,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:19:34 BoogieIcfgContainer [2021-10-13 00:19:34,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:19:34,913 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-13 00:19:34,913 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-13 00:19:34,917 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-13 00:19:34,918 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:19:34,918 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 12:19:34" (1/3) ... [2021-10-13 00:19:34,920 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65c23090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 12:19:34, skipping insertion in model container [2021-10-13 00:19:34,920 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:19:34,920 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:34" (2/3) ... [2021-10-13 00:19:34,921 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65c23090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 12:19:34, skipping insertion in model container [2021-10-13 00:19:34,921 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-13 00:19:34,921 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:19:34" (3/3) ... [2021-10-13 00:19:34,923 INFO L389 chiAutomizerObserver]: Analyzing ICFG rangesum10.i [2021-10-13 00:19:34,969 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-13 00:19:34,969 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-13 00:19:34,970 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-13 00:19:34,970 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-13 00:19:34,970 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-13 00:19:34,970 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-13 00:19:34,970 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-13 00:19:34,970 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-13 00:19:34,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:35,018 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-10-13 00:19:35,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:35,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:35,025 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:19:35,026 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-13 00:19:35,026 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-13 00:19:35,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:35,031 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-10-13 00:19:35,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:35,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:35,040 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-13 00:19:35,043 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-13 00:19:35,065 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 7#L-1true havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 22#L17-3true [2021-10-13 00:19:35,065 INFO L793 eck$LassoCheckResult]: Loop: 22#L17-3true assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 11#L17-2true init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 22#L17-3true [2021-10-13 00:19:35,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-13 00:19:35,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:35,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954886501] [2021-10-13 00:19:35,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:35,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:35,205 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:35,278 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:35,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:35,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-10-13 00:19:35,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:35,283 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009651755] [2021-10-13 00:19:35,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:35,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:35,295 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:35,308 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:35,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:35,315 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-10-13 00:19:35,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:35,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824381780] [2021-10-13 00:19:35,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:35,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:35,356 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:35,417 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:36,038 INFO L210 LassoAnalysis]: Preferences: [2021-10-13 00:19:36,039 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-13 00:19:36,039 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-13 00:19:36,039 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-13 00:19:36,039 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-13 00:19:36,039 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:36,040 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-13 00:19:36,040 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-13 00:19:36,040 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration1_Lasso [2021-10-13 00:19:36,041 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-13 00:19:36,041 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-13 00:19:36,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:36,777 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-13 00:19:36,783 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-13 00:19:36,785 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:36,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:36,787 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:36,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-10-13 00:19:36,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:36,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:36,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-13 00:19:36,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:36,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:36,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:36,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-13 00:19:36,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-13 00:19:36,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:36,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:36,861 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:36,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:36,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:36,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-10-13 00:19:36,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:36,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:36,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-13 00:19:36,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:36,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:36,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:36,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-13 00:19:36,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-13 00:19:36,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:36,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:36,901 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:36,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:36,902 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:36,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-10-13 00:19:36,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:36,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:36,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-13 00:19:36,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:36,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:36,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:36,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-13 00:19:36,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-13 00:19:36,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:36,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:36,979 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:36,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:36,980 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:36,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-10-13 00:19:36,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:37,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:37,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:37,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:37,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:37,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-13 00:19:37,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-13 00:19:37,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:37,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:37,081 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:37,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:37,082 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:37,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-10-13 00:19:37,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:37,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:37,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-13 00:19:37,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:37,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:37,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:37,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-13 00:19:37,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-13 00:19:37,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:37,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:37,115 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:37,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:37,116 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:37,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-10-13 00:19:37,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:37,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:37,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-13 00:19:37,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:37,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:37,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:37,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-13 00:19:37,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-13 00:19:37,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:37,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-10-13 00:19:37,151 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:37,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:37,152 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:37,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-10-13 00:19:37,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:37,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:37,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:37,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:37,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:37,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-13 00:19:37,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-13 00:19:37,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:37,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:37,231 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:37,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:37,234 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:37,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:37,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:37,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:37,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:37,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:37,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-13 00:19:37,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-13 00:19:37,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-10-13 00:19:37,290 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-13 00:19:37,346 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-10-13 00:19:37,346 INFO L444 ModelExtractionUtils]: 4 out of 25 variables were initially zero. Simplification set additionally 18 variables to zero. [2021-10-13 00:19:37,348 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:37,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:37,359 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:37,394 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-13 00:19:37,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-10-13 00:19:37,417 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-10-13 00:19:37,417 INFO L513 LassoAnalysis]: Proved termination. [2021-10-13 00:19:37,417 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0, v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_1) = -8*ULTIMATE.start_init_nondet_~i~0 + 19*v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_1 Supporting invariants [] [2021-10-13 00:19:37,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:37,492 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-10-13 00:19:37,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:37,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 00:19:37,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:37,574 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 00:19:37,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:37,640 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-10-13 00:19:37,641 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:37,756 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 78 states and 122 transitions. Complement of second has 7 states. [2021-10-13 00:19:37,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-10-13 00:19:37,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:37,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2021-10-13 00:19:37,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 2 letters. [2021-10-13 00:19:37,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-13 00:19:37,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 4 letters. Loop has 2 letters. [2021-10-13 00:19:37,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-13 00:19:37,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 4 letters. [2021-10-13 00:19:37,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-13 00:19:37,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 122 transitions. [2021-10-13 00:19:37,775 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:37,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 22 states and 32 transitions. [2021-10-13 00:19:37,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-10-13 00:19:37,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-10-13 00:19:37,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2021-10-13 00:19:37,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:37,782 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2021-10-13 00:19:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2021-10-13 00:19:37,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-10-13 00:19:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2021-10-13 00:19:37,806 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2021-10-13 00:19:37,806 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2021-10-13 00:19:37,807 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-13 00:19:37,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2021-10-13 00:19:37,808 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:37,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:37,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:37,809 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-10-13 00:19:37,809 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:37,809 INFO L791 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 190#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 201#L17-3 assume !(init_nondet_~i~0 < 10); 196#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 197#L28-3 [2021-10-13 00:19:37,809 INFO L793 eck$LassoCheckResult]: Loop: 197#L28-3 assume !!(rangesum_~i~1 < 10); 198#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 199#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 197#L28-3 [2021-10-13 00:19:37,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:37,810 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-10-13 00:19:37,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:37,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37430485] [2021-10-13 00:19:37,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:37,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:37,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:37,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37430485] [2021-10-13 00:19:37,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37430485] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:19:37,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:19:37,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:19:37,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335111676] [2021-10-13 00:19:37,862 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:19:37,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:37,863 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2021-10-13 00:19:37,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:37,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931879622] [2021-10-13 00:19:37,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:37,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:37,870 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:37,877 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:37,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:37,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:19:37,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:19:37,953 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:37,968 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2021-10-13 00:19:37,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:19:37,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2021-10-13 00:19:37,974 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:37,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 32 transitions. [2021-10-13 00:19:37,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-10-13 00:19:37,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-10-13 00:19:37,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2021-10-13 00:19:37,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:37,978 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2021-10-13 00:19:37,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2021-10-13 00:19:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-10-13 00:19:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:37,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2021-10-13 00:19:37,982 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-10-13 00:19:37,983 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-10-13 00:19:37,983 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-13 00:19:37,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2021-10-13 00:19:37,985 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:37,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:37,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:37,986 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-10-13 00:19:37,986 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:37,986 INFO L791 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 241#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 253#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 254#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 255#L17-3 assume !(init_nondet_~i~0 < 10); 249#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 250#L28-3 [2021-10-13 00:19:37,987 INFO L793 eck$LassoCheckResult]: Loop: 250#L28-3 assume !!(rangesum_~i~1 < 10); 247#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 248#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 250#L28-3 [2021-10-13 00:19:37,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:37,988 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-10-13 00:19:37,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:37,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581526640] [2021-10-13 00:19:37,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:37,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:38,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:38,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581526640] [2021-10-13 00:19:38,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581526640] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:38,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828996036] [2021-10-13 00:19:38,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:38,080 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:38,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:38,081 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:38,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-13 00:19:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:38,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 00:19:38,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:38,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828996036] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:38,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:19:38,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-10-13 00:19:38,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580739818] [2021-10-13 00:19:38,169 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:19:38,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:38,170 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2021-10-13 00:19:38,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:38,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257902822] [2021-10-13 00:19:38,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:38,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:38,178 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:38,194 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:38,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:38,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:38,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:19:38,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:19:38,276 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:38,303 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2021-10-13 00:19:38,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:19:38,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2021-10-13 00:19:38,304 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:38,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 34 transitions. [2021-10-13 00:19:38,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-10-13 00:19:38,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-10-13 00:19:38,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2021-10-13 00:19:38,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:38,306 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2021-10-13 00:19:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2021-10-13 00:19:38,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-10-13 00:19:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2021-10-13 00:19:38,309 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-10-13 00:19:38,309 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-10-13 00:19:38,310 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-13 00:19:38,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2021-10-13 00:19:38,311 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:38,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:38,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:38,312 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2021-10-13 00:19:38,312 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:38,312 INFO L791 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 311#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 322#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 323#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 324#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 325#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 333#L17-3 assume !(init_nondet_~i~0 < 10); 317#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 318#L28-3 [2021-10-13 00:19:38,312 INFO L793 eck$LassoCheckResult]: Loop: 318#L28-3 assume !!(rangesum_~i~1 < 10); 319#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 320#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 318#L28-3 [2021-10-13 00:19:38,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:38,313 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2021-10-13 00:19:38,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:38,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559484179] [2021-10-13 00:19:38,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:38,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:38,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:38,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559484179] [2021-10-13 00:19:38,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559484179] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:38,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839269894] [2021-10-13 00:19:38,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 00:19:38,364 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:38,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:38,378 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:38,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-13 00:19:38,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 00:19:38,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:19:38,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 00:19:38,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:38,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839269894] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:38,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:19:38,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-10-13 00:19:38,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718698892] [2021-10-13 00:19:38,474 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:19:38,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2021-10-13 00:19:38,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:38,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750194604] [2021-10-13 00:19:38,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:38,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:38,489 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:38,507 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:38,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:38,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:19:38,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:19:38,569 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:38,600 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2021-10-13 00:19:38,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:19:38,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2021-10-13 00:19:38,605 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:38,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 36 transitions. [2021-10-13 00:19:38,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-10-13 00:19:38,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-10-13 00:19:38,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2021-10-13 00:19:38,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:38,608 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2021-10-13 00:19:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2021-10-13 00:19:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-10-13 00:19:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2021-10-13 00:19:38,614 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-10-13 00:19:38,614 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-10-13 00:19:38,614 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-13 00:19:38,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2021-10-13 00:19:38,616 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:38,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:38,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:38,617 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2021-10-13 00:19:38,617 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:38,617 INFO L791 eck$LassoCheckResult]: Stem: 391#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 392#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 403#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 404#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 405#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 406#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 416#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 415#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 414#L17-3 assume !(init_nondet_~i~0 < 10); 398#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 399#L28-3 [2021-10-13 00:19:38,617 INFO L793 eck$LassoCheckResult]: Loop: 399#L28-3 assume !!(rangesum_~i~1 < 10); 400#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 401#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 399#L28-3 [2021-10-13 00:19:38,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:38,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2021-10-13 00:19:38,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:38,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456186520] [2021-10-13 00:19:38,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:38,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:38,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:38,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456186520] [2021-10-13 00:19:38,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456186520] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:38,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567570562] [2021-10-13 00:19:38,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 00:19:38,708 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:38,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:38,710 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:38,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-13 00:19:38,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-10-13 00:19:38,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:19:38,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 00:19:38,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:38,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567570562] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:38,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:19:38,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-10-13 00:19:38,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743727466] [2021-10-13 00:19:38,804 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:19:38,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:38,805 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2021-10-13 00:19:38,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:38,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085309291] [2021-10-13 00:19:38,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:38,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:38,810 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:38,815 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:38,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:38,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:19:38,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:19:38,869 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 14 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:38,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:38,904 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-10-13 00:19:38,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:19:38,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2021-10-13 00:19:38,906 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:38,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 38 transitions. [2021-10-13 00:19:38,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-10-13 00:19:38,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-10-13 00:19:38,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2021-10-13 00:19:38,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:38,907 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2021-10-13 00:19:38,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2021-10-13 00:19:38,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-10-13 00:19:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2021-10-13 00:19:38,910 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-10-13 00:19:38,910 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-10-13 00:19:38,910 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-13 00:19:38,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2021-10-13 00:19:38,911 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:38,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:38,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:38,912 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-10-13 00:19:38,912 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:38,912 INFO L791 eck$LassoCheckResult]: Stem: 483#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 484#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 495#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 496#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 497#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 498#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 503#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 510#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 509#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 508#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 507#L17-3 assume !(init_nondet_~i~0 < 10); 490#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 491#L28-3 [2021-10-13 00:19:38,912 INFO L793 eck$LassoCheckResult]: Loop: 491#L28-3 assume !!(rangesum_~i~1 < 10); 492#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 493#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 491#L28-3 [2021-10-13 00:19:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:38,915 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2021-10-13 00:19:38,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:38,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385981908] [2021-10-13 00:19:38,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:38,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:38,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:38,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385981908] [2021-10-13 00:19:38,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385981908] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:38,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349760357] [2021-10-13 00:19:38,978 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 00:19:38,978 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:38,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:39,007 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:39,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-13 00:19:39,096 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 00:19:39,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:19:39,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 00:19:39,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:39,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349760357] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:39,152 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:19:39,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-10-13 00:19:39,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618207316] [2021-10-13 00:19:39,152 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:19:39,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:39,153 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2021-10-13 00:19:39,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:39,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278732150] [2021-10-13 00:19:39,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:39,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:39,158 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:39,163 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:39,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:39,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:19:39,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:19:39,218 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:39,250 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2021-10-13 00:19:39,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:19:39,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2021-10-13 00:19:39,256 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:39,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2021-10-13 00:19:39,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-10-13 00:19:39,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-10-13 00:19:39,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2021-10-13 00:19:39,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:39,259 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2021-10-13 00:19:39,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2021-10-13 00:19:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-10-13 00:19:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2021-10-13 00:19:39,265 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2021-10-13 00:19:39,265 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2021-10-13 00:19:39,265 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-13 00:19:39,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2021-10-13 00:19:39,266 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:39,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:39,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:39,267 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-10-13 00:19:39,267 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:39,267 INFO L791 eck$LassoCheckResult]: Stem: 586#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 587#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 599#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 600#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 601#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 602#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 606#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 615#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 614#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 613#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 612#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 611#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 610#L17-3 assume !(init_nondet_~i~0 < 10); 593#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 594#L28-3 [2021-10-13 00:19:39,267 INFO L793 eck$LassoCheckResult]: Loop: 594#L28-3 assume !!(rangesum_~i~1 < 10); 595#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 596#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 594#L28-3 [2021-10-13 00:19:39,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:39,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2021-10-13 00:19:39,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:39,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740007039] [2021-10-13 00:19:39,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:39,268 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:39,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:39,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740007039] [2021-10-13 00:19:39,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740007039] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:39,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490062817] [2021-10-13 00:19:39,336 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-10-13 00:19:39,336 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:39,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:39,338 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:39,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-10-13 00:19:39,477 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-10-13 00:19:39,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:19:39,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-13 00:19:39,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:39,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490062817] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:39,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:19:39,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-10-13 00:19:39,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499254908] [2021-10-13 00:19:39,549 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:19:39,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:39,549 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2021-10-13 00:19:39,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:39,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842589785] [2021-10-13 00:19:39,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:39,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:39,555 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:39,560 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:39,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:39,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:19:39,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:19:39,634 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:39,665 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2021-10-13 00:19:39,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:19:39,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 42 transitions. [2021-10-13 00:19:39,666 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:39,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 42 transitions. [2021-10-13 00:19:39,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-10-13 00:19:39,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-10-13 00:19:39,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2021-10-13 00:19:39,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:39,671 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2021-10-13 00:19:39,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2021-10-13 00:19:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-10-13 00:19:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2021-10-13 00:19:39,676 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2021-10-13 00:19:39,676 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2021-10-13 00:19:39,676 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-13 00:19:39,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2021-10-13 00:19:39,677 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:39,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:39,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:39,678 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2021-10-13 00:19:39,678 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:39,679 INFO L791 eck$LassoCheckResult]: Stem: 700#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 701#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 712#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 713#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 714#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 715#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 720#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 731#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 730#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 729#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 728#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 727#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 726#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 725#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 724#L17-3 assume !(init_nondet_~i~0 < 10); 707#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 708#L28-3 [2021-10-13 00:19:39,679 INFO L793 eck$LassoCheckResult]: Loop: 708#L28-3 assume !!(rangesum_~i~1 < 10); 709#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 710#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 708#L28-3 [2021-10-13 00:19:39,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:39,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2021-10-13 00:19:39,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:39,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706507944] [2021-10-13 00:19:39,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:39,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:39,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:39,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706507944] [2021-10-13 00:19:39,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706507944] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:39,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373672960] [2021-10-13 00:19:39,785 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-10-13 00:19:39,786 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:39,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:39,791 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:39,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-10-13 00:19:39,876 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-10-13 00:19:39,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:19:39,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 00:19:39,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:39,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373672960] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:39,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:19:39,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-10-13 00:19:39,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113267509] [2021-10-13 00:19:39,943 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:19:39,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:39,943 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 7 times [2021-10-13 00:19:39,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:39,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546286339] [2021-10-13 00:19:39,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:39,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:39,948 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:39,953 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:40,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:40,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 00:19:40,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:19:40,009 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:40,053 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2021-10-13 00:19:40,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 00:19:40,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2021-10-13 00:19:40,055 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:40,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 44 transitions. [2021-10-13 00:19:40,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-10-13 00:19:40,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-10-13 00:19:40,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2021-10-13 00:19:40,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:40,059 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2021-10-13 00:19:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2021-10-13 00:19:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-10-13 00:19:40,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:40,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2021-10-13 00:19:40,068 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-10-13 00:19:40,068 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-10-13 00:19:40,068 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-13 00:19:40,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2021-10-13 00:19:40,071 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:40,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:40,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:40,072 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2021-10-13 00:19:40,073 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:40,073 INFO L791 eck$LassoCheckResult]: Stem: 825#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 826#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 837#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 838#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 839#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 840#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 845#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 858#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 857#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 856#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 855#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 854#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 853#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 852#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 851#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 850#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 849#L17-3 assume !(init_nondet_~i~0 < 10); 832#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 833#L28-3 [2021-10-13 00:19:40,073 INFO L793 eck$LassoCheckResult]: Loop: 833#L28-3 assume !!(rangesum_~i~1 < 10); 834#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 835#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 833#L28-3 [2021-10-13 00:19:40,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:40,075 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2021-10-13 00:19:40,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:40,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393974986] [2021-10-13 00:19:40,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:40,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:40,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:40,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393974986] [2021-10-13 00:19:40,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393974986] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:40,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190258474] [2021-10-13 00:19:40,168 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-13 00:19:40,168 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:40,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:40,170 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:40,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-10-13 00:19:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:40,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 00:19:40,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:40,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190258474] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:40,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:19:40,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-10-13 00:19:40,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416891223] [2021-10-13 00:19:40,327 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:19:40,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:40,328 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 8 times [2021-10-13 00:19:40,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:40,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111620650] [2021-10-13 00:19:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:40,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:40,339 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:40,353 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:40,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:40,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 00:19:40,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:19:40,412 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:40,451 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2021-10-13 00:19:40,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:19:40,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2021-10-13 00:19:40,452 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:40,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2021-10-13 00:19:40,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-10-13 00:19:40,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-10-13 00:19:40,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2021-10-13 00:19:40,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:40,459 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2021-10-13 00:19:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2021-10-13 00:19:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2021-10-13 00:19:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.25) internal successors, (45), 35 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2021-10-13 00:19:40,471 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2021-10-13 00:19:40,471 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2021-10-13 00:19:40,471 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-13 00:19:40,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2021-10-13 00:19:40,472 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:40,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:40,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:40,472 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2021-10-13 00:19:40,473 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:40,473 INFO L791 eck$LassoCheckResult]: Stem: 961#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 962#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 973#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 974#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 975#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 976#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 981#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 996#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 995#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 994#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 993#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 992#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 991#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 990#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 989#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 988#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 987#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 986#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 985#L17-3 assume !(init_nondet_~i~0 < 10); 968#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 969#L28-3 [2021-10-13 00:19:40,474 INFO L793 eck$LassoCheckResult]: Loop: 969#L28-3 assume !!(rangesum_~i~1 < 10); 970#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 971#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 969#L28-3 [2021-10-13 00:19:40,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:40,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2021-10-13 00:19:40,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:40,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019253875] [2021-10-13 00:19:40,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:40,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:40,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:40,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019253875] [2021-10-13 00:19:40,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019253875] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:40,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550013283] [2021-10-13 00:19:40,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 00:19:40,597 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:40,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:40,602 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:40,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-10-13 00:19:40,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 00:19:40,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:19:40,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 00:19:40,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:40,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550013283] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:40,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:19:40,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-10-13 00:19:40,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010983729] [2021-10-13 00:19:40,782 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:19:40,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:40,783 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 9 times [2021-10-13 00:19:40,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:40,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714671497] [2021-10-13 00:19:40,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:40,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:40,788 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:40,796 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:40,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:40,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 00:19:40,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:19:40,851 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:40,889 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2021-10-13 00:19:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 00:19:40,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2021-10-13 00:19:40,891 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:40,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2021-10-13 00:19:40,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-10-13 00:19:40,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-10-13 00:19:40,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2021-10-13 00:19:40,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:40,892 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2021-10-13 00:19:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2021-10-13 00:19:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2021-10-13 00:19:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.236842105263158) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2021-10-13 00:19:40,903 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2021-10-13 00:19:40,903 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2021-10-13 00:19:40,903 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-13 00:19:40,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2021-10-13 00:19:40,904 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:40,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:40,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:40,905 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2021-10-13 00:19:40,906 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:40,906 INFO L791 eck$LassoCheckResult]: Stem: 1108#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 1109#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1120#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1121#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1122#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1123#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1128#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1145#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1144#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1143#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1142#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1141#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1140#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1139#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1138#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1137#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1136#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1135#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1134#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1133#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1132#L17-3 assume !(init_nondet_~i~0 < 10); 1115#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1116#L28-3 [2021-10-13 00:19:40,906 INFO L793 eck$LassoCheckResult]: Loop: 1116#L28-3 assume !!(rangesum_~i~1 < 10); 1117#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1118#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1116#L28-3 [2021-10-13 00:19:40,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:40,907 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2021-10-13 00:19:40,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:40,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547379338] [2021-10-13 00:19:40,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:40,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:41,055 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:41,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:41,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547379338] [2021-10-13 00:19:41,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547379338] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:41,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668677074] [2021-10-13 00:19:41,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 00:19:41,056 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:41,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:41,062 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:41,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-10-13 00:19:41,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-10-13 00:19:41,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:19:41,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 00:19:41,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:41,302 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:41,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668677074] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:41,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:19:41,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2021-10-13 00:19:41,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433614551] [2021-10-13 00:19:41,304 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:19:41,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:41,304 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 10 times [2021-10-13 00:19:41,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:41,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694950961] [2021-10-13 00:19:41,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:41,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:41,309 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:41,313 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:41,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:41,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:19:41,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:19:41,368 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:41,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:41,416 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2021-10-13 00:19:41,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 00:19:41,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2021-10-13 00:19:41,418 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:41,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2021-10-13 00:19:41,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-10-13 00:19:41,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-10-13 00:19:41,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2021-10-13 00:19:41,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:41,419 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-10-13 00:19:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2021-10-13 00:19:41,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-10-13 00:19:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2021-10-13 00:19:41,423 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-10-13 00:19:41,423 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-10-13 00:19:41,423 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-10-13 00:19:41,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2021-10-13 00:19:41,423 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:41,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:41,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:41,425 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2021-10-13 00:19:41,425 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:41,425 INFO L791 eck$LassoCheckResult]: Stem: 1265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 1266#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1277#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1278#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1279#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1280#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1285#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1304#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1303#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1302#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1301#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1300#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1299#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1298#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1297#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1296#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1295#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1294#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1293#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1292#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1291#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1290#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1289#L17-3 assume !(init_nondet_~i~0 < 10); 1272#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1273#L28-3 [2021-10-13 00:19:41,425 INFO L793 eck$LassoCheckResult]: Loop: 1273#L28-3 assume !!(rangesum_~i~1 < 10); 1274#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1275#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1273#L28-3 [2021-10-13 00:19:41,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:41,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2021-10-13 00:19:41,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:41,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461851976] [2021-10-13 00:19:41,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:41,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:41,455 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:41,492 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:41,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 11 times [2021-10-13 00:19:41,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:41,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795751365] [2021-10-13 00:19:41,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:41,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:41,502 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:41,507 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:41,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:41,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1328180093, now seen corresponding path program 1 times [2021-10-13 00:19:41,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:41,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764677424] [2021-10-13 00:19:41,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:41,508 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-13 00:19:41,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:41,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764677424] [2021-10-13 00:19:41,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764677424] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:19:41,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:19:41,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:19:41,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814146893] [2021-10-13 00:19:41,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:41,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:19:41,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:19:41,610 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:41,644 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2021-10-13 00:19:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:19:41,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2021-10-13 00:19:41,646 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:41,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 58 transitions. [2021-10-13 00:19:41,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-10-13 00:19:41,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-10-13 00:19:41,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 58 transitions. [2021-10-13 00:19:41,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:41,647 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 58 transitions. [2021-10-13 00:19:41,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 58 transitions. [2021-10-13 00:19:41,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2021-10-13 00:19:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 45 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2021-10-13 00:19:41,650 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2021-10-13 00:19:41,650 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2021-10-13 00:19:41,650 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-10-13 00:19:41,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2021-10-13 00:19:41,651 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:41,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:41,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:41,652 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2021-10-13 00:19:41,652 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:41,652 INFO L791 eck$LassoCheckResult]: Stem: 1362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 1363#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1375#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1376#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1377#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1378#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1407#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1406#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1405#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1404#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1403#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1402#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1401#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1400#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1399#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1398#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1397#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1396#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1395#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1394#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1393#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1390#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1389#L17-3 assume !(init_nondet_~i~0 < 10); 1368#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1369#L28-3 assume !!(rangesum_~i~1 < 10); 1370#L29 assume !(rangesum_~i~1 > 5); 1371#L28-2 [2021-10-13 00:19:41,653 INFO L793 eck$LassoCheckResult]: Loop: 1371#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1372#L28-3 assume !!(rangesum_~i~1 < 10); 1392#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1371#L28-2 [2021-10-13 00:19:41,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:41,653 INFO L82 PathProgramCache]: Analyzing trace with hash -95702812, now seen corresponding path program 1 times [2021-10-13 00:19:41,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:41,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970534197] [2021-10-13 00:19:41,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:41,654 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:41,667 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:41,685 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:41,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:41,686 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 12 times [2021-10-13 00:19:41,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:41,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381413823] [2021-10-13 00:19:41,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:41,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:41,690 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:41,694 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:41,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:41,694 INFO L82 PathProgramCache]: Analyzing trace with hash 775842814, now seen corresponding path program 1 times [2021-10-13 00:19:41,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:41,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048871678] [2021-10-13 00:19:41,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:41,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-13 00:19:41,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:41,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048871678] [2021-10-13 00:19:41,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048871678] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:41,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122141368] [2021-10-13 00:19:41,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:41,728 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:41,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:41,730 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:41,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-10-13 00:19:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:41,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 00:19:41,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-13 00:19:41,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122141368] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:41,914 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:19:41,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2021-10-13 00:19:41,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846418479] [2021-10-13 00:19:41,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:41,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:19:41,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:19:41,967 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. cyclomatic complexity: 14 Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:42,032 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2021-10-13 00:19:42,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:19:42,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 67 transitions. [2021-10-13 00:19:42,033 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:42,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 67 transitions. [2021-10-13 00:19:42,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-10-13 00:19:42,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-10-13 00:19:42,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2021-10-13 00:19:42,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:42,036 INFO L681 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2021-10-13 00:19:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2021-10-13 00:19:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2021-10-13 00:19:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2021-10-13 00:19:42,046 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2021-10-13 00:19:42,046 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2021-10-13 00:19:42,067 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-10-13 00:19:42,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 64 transitions. [2021-10-13 00:19:42,068 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:42,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:42,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:42,072 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 1, 1, 1, 1, 1] [2021-10-13 00:19:42,072 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:42,075 INFO L791 eck$LassoCheckResult]: Stem: 1560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 1561#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1574#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1575#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1576#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1577#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1611#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1609#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1608#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1607#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1606#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1605#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1604#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1602#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1601#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1600#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1599#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1598#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1595#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1594#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1591#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1590#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1589#L17-3 assume !(init_nondet_~i~0 < 10); 1566#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1567#L28-3 assume !!(rangesum_~i~1 < 10); 1603#L29 assume !(rangesum_~i~1 > 5); 1570#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1571#L28-3 assume !!(rangesum_~i~1 < 10); 1568#L29 assume !(rangesum_~i~1 > 5); 1569#L28-2 [2021-10-13 00:19:42,076 INFO L793 eck$LassoCheckResult]: Loop: 1569#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1596#L28-3 assume !!(rangesum_~i~1 < 10); 1597#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1569#L28-2 [2021-10-13 00:19:42,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:42,076 INFO L82 PathProgramCache]: Analyzing trace with hash 775842816, now seen corresponding path program 1 times [2021-10-13 00:19:42,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:42,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338277502] [2021-10-13 00:19:42,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:42,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:42,098 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:42,123 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:42,124 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 13 times [2021-10-13 00:19:42,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:42,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778235164] [2021-10-13 00:19:42,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:42,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:42,130 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:42,135 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:42,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:42,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1914342242, now seen corresponding path program 2 times [2021-10-13 00:19:42,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:42,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853284768] [2021-10-13 00:19:42,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:42,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-13 00:19:42,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:42,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853284768] [2021-10-13 00:19:42,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853284768] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:42,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461513288] [2021-10-13 00:19:42,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 00:19:42,191 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:42,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:42,195 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:42,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-10-13 00:19:42,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 00:19:42,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:19:42,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 00:19:42,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-13 00:19:42,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461513288] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:42,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:19:42,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-10-13 00:19:42,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219117687] [2021-10-13 00:19:42,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:42,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:19:42,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:19:42,458 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:42,518 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2021-10-13 00:19:42,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:19:42,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 76 transitions. [2021-10-13 00:19:42,519 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:42,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 76 transitions. [2021-10-13 00:19:42,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-10-13 00:19:42,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-10-13 00:19:42,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 76 transitions. [2021-10-13 00:19:42,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:42,521 INFO L681 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2021-10-13 00:19:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 76 transitions. [2021-10-13 00:19:42,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2021-10-13 00:19:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.140625) internal successors, (73), 63 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2021-10-13 00:19:42,523 INFO L704 BuchiCegarLoop]: Abstraction has 64 states and 73 transitions. [2021-10-13 00:19:42,523 INFO L587 BuchiCegarLoop]: Abstraction has 64 states and 73 transitions. [2021-10-13 00:19:42,524 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-10-13 00:19:42,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 73 transitions. [2021-10-13 00:19:42,524 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:42,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:42,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:42,525 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 2, 1, 1, 1, 1] [2021-10-13 00:19:42,525 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:42,526 INFO L791 eck$LassoCheckResult]: Stem: 1786#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 1787#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1800#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1801#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1802#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1803#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1837#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1836#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1835#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1834#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1833#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1832#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1831#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1830#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1829#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1828#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1827#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1826#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1825#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1824#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1823#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 1817#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 1816#L17-3 assume !(init_nondet_~i~0 < 10); 1792#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1793#L28-3 assume !!(rangesum_~i~1 < 10); 1838#L29 assume !(rangesum_~i~1 > 5); 1796#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1797#L28-3 assume !!(rangesum_~i~1 < 10); 1844#L29 assume !(rangesum_~i~1 > 5); 1843#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1811#L28-3 assume !!(rangesum_~i~1 < 10); 1794#L29 assume !(rangesum_~i~1 > 5); 1795#L28-2 [2021-10-13 00:19:42,526 INFO L793 eck$LassoCheckResult]: Loop: 1795#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 1820#L28-3 assume !!(rangesum_~i~1 < 10); 1821#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1795#L28-2 [2021-10-13 00:19:42,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:42,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1914342244, now seen corresponding path program 2 times [2021-10-13 00:19:42,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:42,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208907718] [2021-10-13 00:19:42,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:42,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:42,539 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:42,555 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:42,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:42,556 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 14 times [2021-10-13 00:19:42,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:42,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066100671] [2021-10-13 00:19:42,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:42,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:42,560 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:42,563 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:42,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:42,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1594065278, now seen corresponding path program 3 times [2021-10-13 00:19:42,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:42,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695617083] [2021-10-13 00:19:42,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:42,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-13 00:19:42,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:42,607 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695617083] [2021-10-13 00:19:42,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695617083] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:42,607 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038731438] [2021-10-13 00:19:42,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 00:19:42,608 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:42,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:42,610 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:42,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-10-13 00:19:42,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-10-13 00:19:42,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:19:42,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 00:19:42,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:42,809 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-13 00:19:42,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038731438] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:42,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:19:42,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-10-13 00:19:42,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525446663] [2021-10-13 00:19:42,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:42,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:19:42,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:19:42,863 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. cyclomatic complexity: 14 Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:42,988 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2021-10-13 00:19:42,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:19:42,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 85 transitions. [2021-10-13 00:19:42,990 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:42,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 85 transitions. [2021-10-13 00:19:42,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-10-13 00:19:42,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-10-13 00:19:42,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 85 transitions. [2021-10-13 00:19:42,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:42,991 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 85 transitions. [2021-10-13 00:19:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 85 transitions. [2021-10-13 00:19:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2021-10-13 00:19:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2021-10-13 00:19:42,994 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 82 transitions. [2021-10-13 00:19:42,994 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 82 transitions. [2021-10-13 00:19:42,994 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-10-13 00:19:42,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 82 transitions. [2021-10-13 00:19:42,994 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:42,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:42,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:42,995 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 3, 1, 1, 1, 1] [2021-10-13 00:19:42,995 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:42,995 INFO L791 eck$LassoCheckResult]: Stem: 2040#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 2041#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2053#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2054#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2055#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2056#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2090#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2089#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2088#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2087#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2086#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2085#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2084#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2083#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2082#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2081#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2080#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2079#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2078#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2077#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2076#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2069#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2068#L17-3 assume !(init_nondet_~i~0 < 10); 2046#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2047#L28-3 assume !!(rangesum_~i~1 < 10); 2097#L29 assume !(rangesum_~i~1 > 5); 2050#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2051#L28-3 assume !!(rangesum_~i~1 < 10); 2048#L29 assume !(rangesum_~i~1 > 5); 2049#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2095#L28-3 assume !!(rangesum_~i~1 < 10); 2094#L29 assume !(rangesum_~i~1 > 5); 2093#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2092#L28-3 assume !!(rangesum_~i~1 < 10); 2091#L29 assume !(rangesum_~i~1 > 5); 2075#L28-2 [2021-10-13 00:19:42,996 INFO L793 eck$LassoCheckResult]: Loop: 2075#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2072#L28-3 assume !!(rangesum_~i~1 < 10); 2073#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2075#L28-2 [2021-10-13 00:19:42,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:42,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1594065280, now seen corresponding path program 3 times [2021-10-13 00:19:42,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:42,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220636603] [2021-10-13 00:19:42,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:42,996 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:43,015 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:43,036 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 15 times [2021-10-13 00:19:43,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:43,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694473605] [2021-10-13 00:19:43,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:43,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:43,042 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:43,045 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:43,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:43,046 INFO L82 PathProgramCache]: Analyzing trace with hash -654604830, now seen corresponding path program 4 times [2021-10-13 00:19:43,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:43,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855479660] [2021-10-13 00:19:43,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:43,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-13 00:19:43,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:43,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855479660] [2021-10-13 00:19:43,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855479660] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:43,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129411479] [2021-10-13 00:19:43,120 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 00:19:43,120 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:43,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:43,126 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:43,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-10-13 00:19:43,268 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 00:19:43,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:19:43,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 00:19:43,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-13 00:19:43,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129411479] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:43,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:19:43,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-10-13 00:19:43,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656037450] [2021-10-13 00:19:43,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:43,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:19:43,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:19:43,437 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. cyclomatic complexity: 14 Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:43,523 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2021-10-13 00:19:43,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:19:43,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 94 transitions. [2021-10-13 00:19:43,525 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:43,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 94 transitions. [2021-10-13 00:19:43,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2021-10-13 00:19:43,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2021-10-13 00:19:43,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 94 transitions. [2021-10-13 00:19:43,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:43,526 INFO L681 BuchiCegarLoop]: Abstraction has 85 states and 94 transitions. [2021-10-13 00:19:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 94 transitions. [2021-10-13 00:19:43,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2021-10-13 00:19:43,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.1097560975609757) internal successors, (91), 81 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:43,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2021-10-13 00:19:43,529 INFO L704 BuchiCegarLoop]: Abstraction has 82 states and 91 transitions. [2021-10-13 00:19:43,529 INFO L587 BuchiCegarLoop]: Abstraction has 82 states and 91 transitions. [2021-10-13 00:19:43,529 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-10-13 00:19:43,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 91 transitions. [2021-10-13 00:19:43,530 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:43,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:43,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:43,531 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 4, 1, 1, 1, 1] [2021-10-13 00:19:43,531 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:43,531 INFO L791 eck$LassoCheckResult]: Stem: 2322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 2323#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2335#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2336#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2337#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2338#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2373#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2372#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2371#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2370#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2369#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2368#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2367#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2366#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2365#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2364#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2363#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2362#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2361#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2360#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2359#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2352#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2351#L17-3 assume !(init_nondet_~i~0 < 10); 2328#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2329#L28-3 assume !!(rangesum_~i~1 < 10); 2383#L29 assume !(rangesum_~i~1 > 5); 2333#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2334#L28-3 assume !!(rangesum_~i~1 < 10); 2330#L29 assume !(rangesum_~i~1 > 5); 2331#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2381#L28-3 assume !!(rangesum_~i~1 < 10); 2380#L29 assume !(rangesum_~i~1 > 5); 2379#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2378#L28-3 assume !!(rangesum_~i~1 < 10); 2377#L29 assume !(rangesum_~i~1 > 5); 2376#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2375#L28-3 assume !!(rangesum_~i~1 < 10); 2374#L29 assume !(rangesum_~i~1 > 5); 2358#L28-2 [2021-10-13 00:19:43,531 INFO L793 eck$LassoCheckResult]: Loop: 2358#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2355#L28-3 assume !!(rangesum_~i~1 < 10); 2356#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2358#L28-2 [2021-10-13 00:19:43,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:43,531 INFO L82 PathProgramCache]: Analyzing trace with hash -654604828, now seen corresponding path program 4 times [2021-10-13 00:19:43,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:43,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728095801] [2021-10-13 00:19:43,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:43,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:43,547 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:43,562 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:43,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:43,563 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 16 times [2021-10-13 00:19:43,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:43,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060483581] [2021-10-13 00:19:43,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:43,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:43,567 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:43,570 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:43,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:43,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2114090750, now seen corresponding path program 5 times [2021-10-13 00:19:43,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:43,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080002819] [2021-10-13 00:19:43,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:43,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-13 00:19:43,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:43,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080002819] [2021-10-13 00:19:43,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080002819] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:43,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464751224] [2021-10-13 00:19:43,653 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-10-13 00:19:43,653 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:43,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:43,659 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:43,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-10-13 00:19:43,850 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-10-13 00:19:43,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:19:43,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-13 00:19:43,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-13 00:19:43,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464751224] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:43,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:19:43,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-10-13 00:19:43,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577783300] [2021-10-13 00:19:44,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:44,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:19:44,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:19:44,044 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. cyclomatic complexity: 14 Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:44,142 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2021-10-13 00:19:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:19:44,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 103 transitions. [2021-10-13 00:19:44,143 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-10-13 00:19:44,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 103 transitions. [2021-10-13 00:19:44,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2021-10-13 00:19:44,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2021-10-13 00:19:44,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 103 transitions. [2021-10-13 00:19:44,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 00:19:44,145 INFO L681 BuchiCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-10-13 00:19:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 103 transitions. [2021-10-13 00:19:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2021-10-13 00:19:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.098901098901099) internal successors, (100), 90 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2021-10-13 00:19:44,148 INFO L704 BuchiCegarLoop]: Abstraction has 91 states and 100 transitions. [2021-10-13 00:19:44,148 INFO L587 BuchiCegarLoop]: Abstraction has 91 states and 100 transitions. [2021-10-13 00:19:44,148 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-10-13 00:19:44,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 100 transitions. [2021-10-13 00:19:44,149 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:44,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:44,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:44,150 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 5, 1, 1, 1, 1] [2021-10-13 00:19:44,150 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:44,151 INFO L791 eck$LassoCheckResult]: Stem: 2632#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 2633#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2645#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2646#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2647#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2648#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2682#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2681#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2680#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2679#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2678#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2677#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2676#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2675#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2674#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2673#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2672#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2671#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2670#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2667#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2662#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 2661#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 2660#L17-3 assume !(init_nondet_~i~0 < 10); 2638#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2639#L28-3 assume !!(rangesum_~i~1 < 10); 2706#L29 assume !(rangesum_~i~1 > 5); 2642#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2643#L28-3 assume !!(rangesum_~i~1 < 10); 2640#L29 assume !(rangesum_~i~1 > 5); 2641#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2705#L28-3 assume !!(rangesum_~i~1 < 10); 2704#L29 assume !(rangesum_~i~1 > 5); 2703#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2702#L28-3 assume !!(rangesum_~i~1 < 10); 2701#L29 assume !(rangesum_~i~1 > 5); 2700#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2699#L28-3 assume !!(rangesum_~i~1 < 10); 2698#L29 assume !(rangesum_~i~1 > 5); 2697#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2696#L28-3 assume !!(rangesum_~i~1 < 10); 2695#L29 assume !(rangesum_~i~1 > 5); 2669#L28-2 [2021-10-13 00:19:44,151 INFO L793 eck$LassoCheckResult]: Loop: 2669#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 2665#L28-3 assume !!(rangesum_~i~1 < 10); 2666#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2669#L28-2 [2021-10-13 00:19:44,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:44,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2114090752, now seen corresponding path program 5 times [2021-10-13 00:19:44,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:44,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409183145] [2021-10-13 00:19:44,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:44,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:44,165 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:44,183 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:44,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:44,184 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 17 times [2021-10-13 00:19:44,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:44,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973544083] [2021-10-13 00:19:44,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:44,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:44,189 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:44,191 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:44,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:44,192 INFO L82 PathProgramCache]: Analyzing trace with hash -522805150, now seen corresponding path program 6 times [2021-10-13 00:19:44,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:44,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400387933] [2021-10-13 00:19:44,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:44,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:44,213 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:44,254 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:52,585 WARN L207 SmtUtils]: Spent 8.26 s on a formula simplification. DAG size of input: 296 DAG size of output: 212 [2021-10-13 00:19:53,708 INFO L210 LassoAnalysis]: Preferences: [2021-10-13 00:19:53,708 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-13 00:19:53,708 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-13 00:19:53,708 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-13 00:19:53,708 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-13 00:19:53,708 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:53,709 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-13 00:19:53,709 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-13 00:19:53,709 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration18_Lasso [2021-10-13 00:19:53,710 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-13 00:19:53,710 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-13 00:19:53,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:54,561 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-13 00:19:54,561 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-13 00:19:54,561 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:54,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:54,565 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:54,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-10-13 00:19:54,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:54,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:54,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:54,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:54,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:54,580 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-13 00:19:54,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-13 00:19:54,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:54,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-10-13 00:19:54,613 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:54,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:54,614 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:54,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-10-13 00:19:54,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:54,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:54,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:54,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:54,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:54,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-13 00:19:54,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-13 00:19:54,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:54,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-10-13 00:19:54,651 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:54,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:54,651 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:54,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-10-13 00:19:54,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:54,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:54,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:54,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:54,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:54,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-13 00:19:54,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-13 00:19:54,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:54,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:54,695 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:54,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:54,697 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:54,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:54,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-10-13 00:19:54,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:54,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:54,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:54,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:54,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-13 00:19:54,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-13 00:19:54,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:54,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:54,785 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:54,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:54,786 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:54,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-10-13 00:19:54,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:54,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:54,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:54,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:54,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:54,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-13 00:19:54,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-13 00:19:54,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:54,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:54,836 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:54,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:54,836 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:54,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-10-13 00:19:54,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:54,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:54,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:54,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:54,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:54,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-13 00:19:54,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-13 00:19:54,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:54,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:54,884 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:54,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:54,894 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:54,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-10-13 00:19:54,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:54,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:54,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:54,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:54,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:54,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-13 00:19:54,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-13 00:19:54,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:54,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:54,929 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:54,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:54,930 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:54,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-10-13 00:19:54,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:54,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:54,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:54,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:54,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:54,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-13 00:19:54,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-13 00:19:54,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:54,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:54,990 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:54,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:55,006 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:55,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:55,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:55,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-13 00:19:55,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:55,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:55,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:55,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-13 00:19:55,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-13 00:19:55,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-10-13 00:19:55,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:55,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:55,064 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:55,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:55,065 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:55,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-10-13 00:19:55,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:55,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:55,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:55,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:55,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:55,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-13 00:19:55,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-13 00:19:55,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-13 00:19:55,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:55,097 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:55,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:55,099 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:55,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-10-13 00:19:55,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:55,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:55,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:55,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:55,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:55,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-13 00:19:55,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-13 00:19:55,149 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-13 00:19:55,202 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2021-10-13 00:19:55,202 INFO L444 ModelExtractionUtils]: 16 out of 34 variables were initially zero. Simplification set additionally 15 variables to zero. [2021-10-13 00:19:55,203 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:55,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:55,204 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:55,206 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-13 00:19:55,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-10-13 00:19:55,226 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-10-13 00:19:55,227 INFO L513 LassoAnalysis]: Proved termination. [2021-10-13 00:19:55,227 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 17 Supporting invariants [] [2021-10-13 00:19:55,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:55,319 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2021-10-13 00:19:55,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:55,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 00:19:55,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:55,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 00:19:55,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:55,540 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-10-13 00:19:55,541 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 100 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:55,571 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 100 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 104 states and 116 transitions. Complement of second has 7 states. [2021-10-13 00:19:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-10-13 00:19:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2021-10-13 00:19:55,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 41 letters. Loop has 3 letters. [2021-10-13 00:19:55,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-13 00:19:55,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 44 letters. Loop has 3 letters. [2021-10-13 00:19:55,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-13 00:19:55,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 41 letters. Loop has 6 letters. [2021-10-13 00:19:55,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-13 00:19:55,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 116 transitions. [2021-10-13 00:19:55,576 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-10-13 00:19:55,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 93 states and 104 transitions. [2021-10-13 00:19:55,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2021-10-13 00:19:55,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-10-13 00:19:55,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 104 transitions. [2021-10-13 00:19:55,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-13 00:19:55,578 INFO L681 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2021-10-13 00:19:55,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 104 transitions. [2021-10-13 00:19:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-10-13 00:19:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.118279569892473) internal successors, (104), 92 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2021-10-13 00:19:55,581 INFO L704 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2021-10-13 00:19:55,581 INFO L587 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2021-10-13 00:19:55,581 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-10-13 00:19:55,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 104 transitions. [2021-10-13 00:19:55,582 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-10-13 00:19:55,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:55,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:55,583 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:19:55,583 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:55,584 INFO L791 eck$LassoCheckResult]: Stem: 3044#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 3045#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 3060#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3061#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3062#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3063#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3070#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3120#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3119#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3118#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3117#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3116#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3115#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3114#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3113#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3112#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3111#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3110#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3109#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3108#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3107#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3077#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3076#L17-3 assume !(init_nondet_~i~0 < 10); 3050#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 3051#L28-3 assume !!(rangesum_~i~1 < 10); 3052#L29 assume !(rangesum_~i~1 > 5); 3053#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3056#L28-3 assume !!(rangesum_~i~1 < 10); 3101#L29 assume !(rangesum_~i~1 > 5); 3057#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3058#L28-3 assume !!(rangesum_~i~1 < 10); 3054#L29 assume !(rangesum_~i~1 > 5); 3055#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3098#L28-3 assume !!(rangesum_~i~1 < 10); 3096#L29 assume !(rangesum_~i~1 > 5); 3094#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3092#L28-3 assume !!(rangesum_~i~1 < 10); 3090#L29 assume !(rangesum_~i~1 > 5); 3088#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3086#L28-3 assume !!(rangesum_~i~1 < 10); 3083#L29 assume !(rangesum_~i~1 > 5); 3078#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3072#L28-3 assume !(rangesum_~i~1 < 10); 3073#L28-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 3066#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 3048#L28-8 assume !!(rangesum_~i~1 < 10); 3049#L29-2 assume !(rangesum_~i~1 > 5); 3064#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3065#L28-8 assume !!(rangesum_~i~1 < 10); 3106#L29-2 assume !(rangesum_~i~1 > 5); 3105#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3104#L28-8 assume !!(rangesum_~i~1 < 10); 3103#L29-2 assume !(rangesum_~i~1 > 5); 3102#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3100#L28-8 assume !!(rangesum_~i~1 < 10); 3099#L29-2 assume !(rangesum_~i~1 > 5); 3097#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3095#L28-8 assume !!(rangesum_~i~1 < 10); 3093#L29-2 assume !(rangesum_~i~1 > 5); 3091#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3089#L28-8 assume !!(rangesum_~i~1 < 10); 3087#L29-2 assume !(rangesum_~i~1 > 5); 3084#L28-7 [2021-10-13 00:19:55,584 INFO L793 eck$LassoCheckResult]: Loop: 3084#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3079#L28-8 assume !!(rangesum_~i~1 < 10); 3080#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 3084#L28-7 [2021-10-13 00:19:55,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:55,584 INFO L82 PathProgramCache]: Analyzing trace with hash -365260545, now seen corresponding path program 1 times [2021-10-13 00:19:55,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:55,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292581662] [2021-10-13 00:19:55,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:55,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:55,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-10-13 00:19:55,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:55,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292581662] [2021-10-13 00:19:55,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292581662] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:19:55,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:19:55,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:19:55,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444894870] [2021-10-13 00:19:55,669 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:19:55,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:55,669 INFO L82 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2021-10-13 00:19:55,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:55,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742849177] [2021-10-13 00:19:55,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:55,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:55,672 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:55,674 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:55,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:55,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:19:55,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:19:55,738 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:55,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:55,788 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2021-10-13 00:19:55,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:19:55,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 123 transitions. [2021-10-13 00:19:55,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-10-13 00:19:55,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 106 states and 119 transitions. [2021-10-13 00:19:55,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2021-10-13 00:19:55,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2021-10-13 00:19:55,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 119 transitions. [2021-10-13 00:19:55,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-13 00:19:55,791 INFO L681 BuchiCegarLoop]: Abstraction has 106 states and 119 transitions. [2021-10-13 00:19:55,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 119 transitions. [2021-10-13 00:19:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2021-10-13 00:19:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.0947368421052632) internal successors, (104), 94 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2021-10-13 00:19:55,794 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2021-10-13 00:19:55,794 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2021-10-13 00:19:55,794 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-10-13 00:19:55,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 104 transitions. [2021-10-13 00:19:55,795 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-10-13 00:19:55,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:55,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:55,796 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:19:55,796 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:55,796 INFO L791 eck$LassoCheckResult]: Stem: 3252#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 3253#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 3268#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3269#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3270#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3271#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3304#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3303#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3302#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3301#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3300#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3299#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3298#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3297#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3296#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3295#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3294#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3293#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3292#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3291#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3290#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 3285#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 3284#L17-3 assume !(init_nondet_~i~0 < 10); 3258#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 3259#L28-3 assume !!(rangesum_~i~1 < 10); 3260#L29 assume !(rangesum_~i~1 > 5); 3261#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3264#L28-3 assume !!(rangesum_~i~1 < 10); 3330#L29 assume !(rangesum_~i~1 > 5); 3265#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3266#L28-3 assume !!(rangesum_~i~1 < 10); 3262#L29 assume !(rangesum_~i~1 > 5); 3263#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3329#L28-3 assume !!(rangesum_~i~1 < 10); 3328#L29 assume !(rangesum_~i~1 > 5); 3327#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3326#L28-3 assume !!(rangesum_~i~1 < 10); 3325#L29 assume !(rangesum_~i~1 > 5); 3324#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3323#L28-3 assume !!(rangesum_~i~1 < 10); 3322#L29 assume !(rangesum_~i~1 > 5); 3307#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3321#L28-3 assume !!(rangesum_~i~1 < 10); 3306#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 3286#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3279#L28-3 assume !(rangesum_~i~1 < 10); 3280#L28-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 3273#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 3274#L28-8 assume !!(rangesum_~i~1 < 10); 3283#L29-2 assume !(rangesum_~i~1 > 5); 3272#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3256#L28-8 assume !!(rangesum_~i~1 < 10); 3257#L29-2 assume !(rangesum_~i~1 > 5); 3320#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3319#L28-8 assume !!(rangesum_~i~1 < 10); 3318#L29-2 assume !(rangesum_~i~1 > 5); 3317#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3316#L28-8 assume !!(rangesum_~i~1 < 10); 3315#L29-2 assume !(rangesum_~i~1 > 5); 3314#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3313#L28-8 assume !!(rangesum_~i~1 < 10); 3312#L29-2 assume !(rangesum_~i~1 > 5); 3311#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3310#L28-8 assume !!(rangesum_~i~1 < 10); 3309#L29-2 assume !(rangesum_~i~1 > 5); 3305#L28-7 [2021-10-13 00:19:55,796 INFO L793 eck$LassoCheckResult]: Loop: 3305#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 3308#L28-8 assume !!(rangesum_~i~1 < 10); 3288#L29-2 assume !(rangesum_~i~1 > 5); 3305#L28-7 [2021-10-13 00:19:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:55,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1039890653, now seen corresponding path program 1 times [2021-10-13 00:19:55,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:55,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702103864] [2021-10-13 00:19:55,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:55,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2021-10-13 00:19:55,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:55,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702103864] [2021-10-13 00:19:55,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702103864] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:55,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111018610] [2021-10-13 00:19:55,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:55,865 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:55,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:55,866 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:55,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-10-13 00:19:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:56,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 00:19:56,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2021-10-13 00:19:56,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111018610] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:19:56,228 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:19:56,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-10-13 00:19:56,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326542146] [2021-10-13 00:19:56,228 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:19:56,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:56,229 INFO L82 PathProgramCache]: Analyzing trace with hash 85180, now seen corresponding path program 1 times [2021-10-13 00:19:56,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:56,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503833915] [2021-10-13 00:19:56,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:56,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:56,232 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:56,234 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:56,250 INFO L210 LassoAnalysis]: Preferences: [2021-10-13 00:19:56,251 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-13 00:19:56,251 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-13 00:19:56,251 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-13 00:19:56,251 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-10-13 00:19:56,251 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:56,251 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-13 00:19:56,251 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-13 00:19:56,252 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration20_Loop [2021-10-13 00:19:56,252 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-13 00:19:56,252 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-13 00:19:56,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:56,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:56,275 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-13 00:19:56,276 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-10-13 00:19:56,278 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:56,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:56,279 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:56,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-10-13 00:19:56,281 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-13 00:19:56,281 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-13 00:19:56,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-10-13 00:19:56,309 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:56,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:56,309 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:56,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-10-13 00:19:56,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-10-13 00:19:56,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-13 00:19:56,397 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-10-13 00:19:56,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:56,400 INFO L210 LassoAnalysis]: Preferences: [2021-10-13 00:19:56,400 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-13 00:19:56,400 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-13 00:19:56,400 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-13 00:19:56,400 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-13 00:19:56,400 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:56,400 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-13 00:19:56,400 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-13 00:19:56,401 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration20_Loop [2021-10-13 00:19:56,401 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-13 00:19:56,401 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-13 00:19:56,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:56,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-13 00:19:56,429 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-13 00:19:56,429 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-13 00:19:56,429 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:56,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:56,431 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:56,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-13 00:19:56,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-10-13 00:19:56,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-13 00:19:56,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-13 00:19:56,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-13 00:19:56,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-13 00:19:56,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-13 00:19:56,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-13 00:19:56,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-13 00:19:56,474 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-13 00:19:56,476 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-10-13 00:19:56,477 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-10-13 00:19:56,477 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-13 00:19:56,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:56,482 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-13 00:19:56,485 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-13 00:19:56,485 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-10-13 00:19:56,485 INFO L513 LassoAnalysis]: Proved termination. [2021-10-13 00:19:56,486 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 9 Supporting invariants [] [2021-10-13 00:19:56,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-10-13 00:19:56,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:56,519 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-10-13 00:19:56,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:56,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 00:19:56,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:56,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-10-13 00:19:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:56,813 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 00:19:56,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:19:56,830 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-10-13 00:19:56,830 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 104 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:56,860 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 104 transitions. cyclomatic complexity: 14. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 114 states and 126 transitions. Complement of second has 5 states. [2021-10-13 00:19:56,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-10-13 00:19:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2021-10-13 00:19:56,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 65 letters. Loop has 3 letters. [2021-10-13 00:19:56,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-13 00:19:56,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 68 letters. Loop has 3 letters. [2021-10-13 00:19:56,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-13 00:19:56,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 65 letters. Loop has 6 letters. [2021-10-13 00:19:56,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-13 00:19:56,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2021-10-13 00:19:56,863 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-10-13 00:19:56,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 99 states and 109 transitions. [2021-10-13 00:19:56,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-10-13 00:19:56,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2021-10-13 00:19:56,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 109 transitions. [2021-10-13 00:19:56,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-13 00:19:56,865 INFO L681 BuchiCegarLoop]: Abstraction has 99 states and 109 transitions. [2021-10-13 00:19:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 109 transitions. [2021-10-13 00:19:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-10-13 00:19:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.1020408163265305) internal successors, (108), 97 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2021-10-13 00:19:56,867 INFO L704 BuchiCegarLoop]: Abstraction has 98 states and 108 transitions. [2021-10-13 00:19:56,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:56,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:19:56,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:19:56,868 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:56,891 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2021-10-13 00:19:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:19:56,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 122 transitions. [2021-10-13 00:19:56,892 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-10-13 00:19:56,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 109 states and 122 transitions. [2021-10-13 00:19:56,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2021-10-13 00:19:56,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2021-10-13 00:19:56,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 122 transitions. [2021-10-13 00:19:56,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-13 00:19:56,894 INFO L681 BuchiCegarLoop]: Abstraction has 109 states and 122 transitions. [2021-10-13 00:19:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 122 transitions. [2021-10-13 00:19:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2021-10-13 00:19:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.0816326530612246) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-10-13 00:19:56,898 INFO L704 BuchiCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-10-13 00:19:56,898 INFO L587 BuchiCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-10-13 00:19:56,898 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-10-13 00:19:56,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 106 transitions. [2021-10-13 00:19:56,899 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-10-13 00:19:56,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:56,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:56,900 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:19:56,900 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:56,900 INFO L791 eck$LassoCheckResult]: Stem: 4086#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 4087#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 4103#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4104#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4105#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4106#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4143#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4142#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4141#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4140#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4139#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4138#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4137#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4136#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4135#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4134#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4133#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4132#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4129#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4127#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4126#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4123#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4122#L17-3 assume !(init_nondet_~i~0 < 10); 4094#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4095#L28-3 assume !!(rangesum_~i~1 < 10); 4096#L29 assume !(rangesum_~i~1 > 5); 4097#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4100#L28-3 assume !!(rangesum_~i~1 < 10); 4098#L29 assume !(rangesum_~i~1 > 5); 4099#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4101#L28-3 assume !!(rangesum_~i~1 < 10); 4118#L29 assume !(rangesum_~i~1 > 5); 4156#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4155#L28-3 assume !!(rangesum_~i~1 < 10); 4154#L29 assume !(rangesum_~i~1 > 5); 4153#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4152#L28-3 assume !!(rangesum_~i~1 < 10); 4151#L29 assume !(rangesum_~i~1 > 5); 4150#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4149#L28-3 assume !!(rangesum_~i~1 < 10); 4148#L29 assume !(rangesum_~i~1 > 5); 4131#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4147#L28-3 assume !!(rangesum_~i~1 < 10); 4130#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4128#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4116#L28-3 assume !(rangesum_~i~1 < 10); 4117#L28-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 4110#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4111#L28-8 assume !!(rangesum_~i~1 < 10); 4121#L29-2 assume !(rangesum_~i~1 > 5); 4107#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4092#L28-8 assume !!(rangesum_~i~1 < 10); 4093#L29-2 assume !(rangesum_~i~1 > 5); 4108#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4109#L28-8 assume !!(rangesum_~i~1 < 10); 4167#L29-2 assume !(rangesum_~i~1 > 5); 4166#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4165#L28-8 assume !!(rangesum_~i~1 < 10); 4164#L29-2 assume !(rangesum_~i~1 > 5); 4163#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4162#L28-8 assume !!(rangesum_~i~1 < 10); 4159#L29-2 assume !(rangesum_~i~1 > 5); 4160#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4161#L28-8 assume !!(rangesum_~i~1 < 10); 4146#L29-2 assume !(rangesum_~i~1 > 5); 4144#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4090#L28-8 assume !!(rangesum_~i~1 < 10); 4091#L29-2 [2021-10-13 00:19:56,901 INFO L793 eck$LassoCheckResult]: Loop: 4091#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4125#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4124#L28-8 assume !!(rangesum_~i~1 < 10); 4091#L29-2 [2021-10-13 00:19:56,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:56,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1815162476, now seen corresponding path program 1 times [2021-10-13 00:19:56,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:56,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469629947] [2021-10-13 00:19:56,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:56,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:56,914 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-13 00:19:56,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [69583311] [2021-10-13 00:19:56,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:56,915 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:56,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:56,918 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:56,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-10-13 00:19:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:57,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 00:19:57,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2021-10-13 00:19:57,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:57,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469629947] [2021-10-13 00:19:57,357 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-13 00:19:57,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69583311] [2021-10-13 00:19:57,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69583311] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:57,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:19:57,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2021-10-13 00:19:57,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218715111] [2021-10-13 00:19:57,358 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:19:57,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:57,358 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 2 times [2021-10-13 00:19:57,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:57,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654336079] [2021-10-13 00:19:57,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:57,359 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:57,363 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:57,366 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:57,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:57,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 00:19:57,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:19:57,426 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. cyclomatic complexity: 14 Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:57,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:57,592 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2021-10-13 00:19:57,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:19:57,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 141 transitions. [2021-10-13 00:19:57,593 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2021-10-13 00:19:57,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 124 states and 139 transitions. [2021-10-13 00:19:57,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-10-13 00:19:57,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-10-13 00:19:57,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 139 transitions. [2021-10-13 00:19:57,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-13 00:19:57,596 INFO L681 BuchiCegarLoop]: Abstraction has 124 states and 139 transitions. [2021-10-13 00:19:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 139 transitions. [2021-10-13 00:19:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 104. [2021-10-13 00:19:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.0865384615384615) internal successors, (113), 103 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2021-10-13 00:19:57,600 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 113 transitions. [2021-10-13 00:19:57,600 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 113 transitions. [2021-10-13 00:19:57,600 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-10-13 00:19:57,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 113 transitions. [2021-10-13 00:19:57,601 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-10-13 00:19:57,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:57,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:57,602 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:19:57,602 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:57,602 INFO L791 eck$LassoCheckResult]: Stem: 4521#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 4522#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 4539#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4540#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4541#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4542#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4580#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4579#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4578#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4577#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4576#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4575#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4574#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4573#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4572#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4571#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4570#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4569#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4568#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4567#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4566#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 4561#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 4560#L17-3 assume !(init_nondet_~i~0 < 10); 4529#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4530#L28-3 assume !!(rangesum_~i~1 < 10); 4531#L29 assume !(rangesum_~i~1 > 5); 4532#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4535#L28-3 assume !!(rangesum_~i~1 < 10); 4554#L29 assume !(rangesum_~i~1 > 5); 4536#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4537#L28-3 assume !!(rangesum_~i~1 < 10); 4533#L29 assume !(rangesum_~i~1 > 5); 4534#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4599#L28-3 assume !!(rangesum_~i~1 < 10); 4598#L29 assume !(rangesum_~i~1 > 5); 4597#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4596#L28-3 assume !!(rangesum_~i~1 < 10); 4595#L29 assume !(rangesum_~i~1 > 5); 4594#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4593#L28-3 assume !!(rangesum_~i~1 < 10); 4592#L29 assume !(rangesum_~i~1 > 5); 4585#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4591#L28-3 assume !!(rangesum_~i~1 < 10); 4590#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4584#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4589#L28-3 assume !!(rangesum_~i~1 < 10); 4583#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4565#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4552#L28-3 assume !(rangesum_~i~1 < 10); 4553#L28-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 4546#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4547#L28-8 assume !!(rangesum_~i~1 < 10); 4557#L29-2 assume !(rangesum_~i~1 > 5); 4543#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4544#L28-8 assume !!(rangesum_~i~1 < 10); 4607#L29-2 assume !(rangesum_~i~1 > 5); 4545#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4527#L28-8 assume !!(rangesum_~i~1 < 10); 4528#L29-2 assume !(rangesum_~i~1 > 5); 4602#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4606#L28-8 assume !!(rangesum_~i~1 < 10); 4605#L29-2 assume !(rangesum_~i~1 > 5); 4604#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4603#L28-8 assume !!(rangesum_~i~1 < 10); 4558#L29-2 assume !(rangesum_~i~1 > 5); 4559#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4608#L28-8 assume !!(rangesum_~i~1 < 10); 4588#L29-2 assume !(rangesum_~i~1 > 5); 4586#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4525#L28-8 assume !!(rangesum_~i~1 < 10); 4526#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4582#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4581#L28-8 assume !!(rangesum_~i~1 < 10); 4563#L29-2 [2021-10-13 00:19:57,602 INFO L793 eck$LassoCheckResult]: Loop: 4563#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4564#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 4562#L28-8 assume !!(rangesum_~i~1 < 10); 4563#L29-2 [2021-10-13 00:19:57,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:57,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2012858871, now seen corresponding path program 1 times [2021-10-13 00:19:57,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:57,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952760408] [2021-10-13 00:19:57,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:57,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:57,614 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-13 00:19:57,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [733118744] [2021-10-13 00:19:57,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:57,615 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:57,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:57,622 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:57,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-10-13 00:19:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:19:57,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 00:19:57,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2021-10-13 00:19:58,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:58,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952760408] [2021-10-13 00:19:58,124 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-13 00:19:58,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733118744] [2021-10-13 00:19:58,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733118744] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:58,125 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:19:58,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-10-13 00:19:58,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640665378] [2021-10-13 00:19:58,125 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:19:58,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:58,126 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 3 times [2021-10-13 00:19:58,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:58,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725059774] [2021-10-13 00:19:58,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:58,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:58,132 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:58,135 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:58,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:58,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 00:19:58,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:19:58,196 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. cyclomatic complexity: 15 Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:58,347 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2021-10-13 00:19:58,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 00:19:58,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 156 transitions. [2021-10-13 00:19:58,349 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2021-10-13 00:19:58,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 136 states and 154 transitions. [2021-10-13 00:19:58,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2021-10-13 00:19:58,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2021-10-13 00:19:58,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 154 transitions. [2021-10-13 00:19:58,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-13 00:19:58,351 INFO L681 BuchiCegarLoop]: Abstraction has 136 states and 154 transitions. [2021-10-13 00:19:58,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 154 transitions. [2021-10-13 00:19:58,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2021-10-13 00:19:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.0909090909090908) internal successors, (120), 109 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-10-13 00:19:58,369 INFO L704 BuchiCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-10-13 00:19:58,369 INFO L587 BuchiCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-10-13 00:19:58,369 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-10-13 00:19:58,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 120 transitions. [2021-10-13 00:19:58,370 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-10-13 00:19:58,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:58,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:58,391 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 8, 6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:19:58,391 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:58,392 INFO L791 eck$LassoCheckResult]: Stem: 4993#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 4994#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 5012#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5013#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5014#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5015#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5052#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5051#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5050#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5049#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5048#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5047#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5046#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5045#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5044#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5043#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5042#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5041#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5040#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5039#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5038#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5033#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5032#L17-3 assume !(init_nondet_~i~0 < 10); 5001#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 5002#L28-3 assume !!(rangesum_~i~1 < 10); 5003#L29 assume !(rangesum_~i~1 > 5); 5004#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5007#L28-3 assume !!(rangesum_~i~1 < 10); 5027#L29 assume !(rangesum_~i~1 > 5); 5008#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5009#L28-3 assume !!(rangesum_~i~1 < 10); 5005#L29 assume !(rangesum_~i~1 > 5); 5006#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5078#L28-3 assume !!(rangesum_~i~1 < 10); 5077#L29 assume !(rangesum_~i~1 > 5); 5076#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5075#L28-3 assume !!(rangesum_~i~1 < 10); 5074#L29 assume !(rangesum_~i~1 > 5); 5073#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5072#L28-3 assume !!(rangesum_~i~1 < 10); 5071#L29 assume !(rangesum_~i~1 > 5); 5055#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5070#L28-3 assume !!(rangesum_~i~1 < 10); 5069#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5068#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5067#L28-3 assume !!(rangesum_~i~1 < 10); 5066#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5054#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5058#L28-3 assume !!(rangesum_~i~1 < 10); 5053#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5037#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5025#L28-3 assume !(rangesum_~i~1 < 10); 5026#L28-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 5019#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4997#L28-8 assume !!(rangesum_~i~1 < 10); 4998#L29-2 assume !(rangesum_~i~1 > 5); 5016#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5017#L28-8 assume !!(rangesum_~i~1 < 10); 5082#L29-2 assume !(rangesum_~i~1 > 5); 5081#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5079#L28-8 assume !!(rangesum_~i~1 < 10); 5080#L29-2 assume !(rangesum_~i~1 > 5); 5087#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5086#L28-8 assume !!(rangesum_~i~1 < 10); 5085#L29-2 assume !(rangesum_~i~1 > 5); 5084#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5083#L28-8 assume !!(rangesum_~i~1 < 10); 5030#L29-2 assume !(rangesum_~i~1 > 5); 5031#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5088#L28-8 assume !!(rangesum_~i~1 < 10); 5065#L29-2 assume !(rangesum_~i~1 > 5); 5064#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5063#L28-8 assume !!(rangesum_~i~1 < 10); 5061#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5062#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5060#L28-8 assume !!(rangesum_~i~1 < 10); 5059#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5057#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5056#L28-8 assume !!(rangesum_~i~1 < 10); 5035#L29-2 [2021-10-13 00:19:58,392 INFO L793 eck$LassoCheckResult]: Loop: 5035#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5036#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5034#L28-8 assume !!(rangesum_~i~1 < 10); 5035#L29-2 [2021-10-13 00:19:58,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:58,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1646097460, now seen corresponding path program 2 times [2021-10-13 00:19:58,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:58,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405811503] [2021-10-13 00:19:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:58,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:58,421 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-13 00:19:58,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313579147] [2021-10-13 00:19:58,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 00:19:58,422 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:58,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:58,424 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:58,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-10-13 00:19:58,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 00:19:58,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:19:58,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 00:19:58,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:19:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2021-10-13 00:19:59,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:19:59,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405811503] [2021-10-13 00:19:59,094 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-13 00:19:59,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313579147] [2021-10-13 00:19:59,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313579147] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:19:59,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-10-13 00:19:59,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-10-13 00:19:59,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779284123] [2021-10-13 00:19:59,095 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-13 00:19:59,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:59,096 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 4 times [2021-10-13 00:19:59,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:59,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424615763] [2021-10-13 00:19:59,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:59,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:59,102 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:19:59,105 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:19:59,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:19:59,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 00:19:59,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:19:59,197 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. cyclomatic complexity: 16 Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:59,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:19:59,425 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2021-10-13 00:19:59,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 00:19:59,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 158 transitions. [2021-10-13 00:19:59,427 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2021-10-13 00:19:59,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 156 transitions. [2021-10-13 00:19:59,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2021-10-13 00:19:59,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2021-10-13 00:19:59,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 156 transitions. [2021-10-13 00:19:59,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-13 00:19:59,429 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 156 transitions. [2021-10-13 00:19:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 156 transitions. [2021-10-13 00:19:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2021-10-13 00:19:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 115 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:19:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2021-10-13 00:19:59,433 INFO L704 BuchiCegarLoop]: Abstraction has 116 states and 127 transitions. [2021-10-13 00:19:59,433 INFO L587 BuchiCegarLoop]: Abstraction has 116 states and 127 transitions. [2021-10-13 00:19:59,433 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-10-13 00:19:59,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 127 transitions. [2021-10-13 00:19:59,434 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-10-13 00:19:59,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:19:59,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:19:59,436 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:19:59,436 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-13 00:19:59,436 INFO L791 eck$LassoCheckResult]: Stem: 5493#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 5494#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 5515#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5516#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5517#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5518#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5568#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5567#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5566#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5565#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5564#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5562#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5560#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5558#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5556#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5554#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5552#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5550#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5548#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5546#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5544#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 5541#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 5540#L17-3 assume !(init_nondet_~i~0 < 10); 5505#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 5506#L28-3 assume !!(rangesum_~i~1 < 10); 5501#L29 assume !(rangesum_~i~1 > 5); 5502#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5507#L28-3 assume !!(rangesum_~i~1 < 10); 5527#L29 assume !(rangesum_~i~1 > 5); 5508#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5509#L28-3 assume !!(rangesum_~i~1 < 10); 5503#L29 assume !(rangesum_~i~1 > 5); 5504#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5584#L28-3 assume !!(rangesum_~i~1 < 10); 5583#L29 assume !(rangesum_~i~1 > 5); 5582#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5581#L28-3 assume !!(rangesum_~i~1 < 10); 5580#L29 assume !(rangesum_~i~1 > 5); 5579#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5578#L28-3 assume !!(rangesum_~i~1 < 10); 5577#L29 assume !(rangesum_~i~1 > 5); 5537#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5576#L28-3 assume !!(rangesum_~i~1 < 10); 5575#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5574#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5573#L28-3 assume !!(rangesum_~i~1 < 10); 5572#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5571#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5570#L28-3 assume !!(rangesum_~i~1 < 10); 5569#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5536#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5539#L28-3 assume !!(rangesum_~i~1 < 10); 5535#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5532#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5525#L28-3 assume !(rangesum_~i~1 < 10); 5526#L28-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 5519#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 5497#L28-8 assume !!(rangesum_~i~1 < 10); 5498#L29-2 assume !(rangesum_~i~1 > 5); 5512#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5513#L28-8 assume !!(rangesum_~i~1 < 10); 5588#L29-2 assume !(rangesum_~i~1 > 5); 5587#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5585#L28-8 assume !!(rangesum_~i~1 < 10); 5586#L29-2 assume !(rangesum_~i~1 > 5); 5593#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5592#L28-8 assume !!(rangesum_~i~1 < 10); 5591#L29-2 assume !(rangesum_~i~1 > 5); 5590#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5589#L28-8 assume !!(rangesum_~i~1 < 10); 5530#L29-2 assume !(rangesum_~i~1 > 5); 5531#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5594#L28-8 assume !!(rangesum_~i~1 < 10); 5563#L29-2 assume !(rangesum_~i~1 > 5); 5561#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5559#L28-8 assume !!(rangesum_~i~1 < 10); 5557#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5555#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5553#L28-8 assume !!(rangesum_~i~1 < 10); 5551#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5549#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5547#L28-8 assume !!(rangesum_~i~1 < 10); 5545#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5543#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5542#L28-8 assume !!(rangesum_~i~1 < 10); 5534#L29-2 [2021-10-13 00:19:59,437 INFO L793 eck$LassoCheckResult]: Loop: 5534#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5538#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 5533#L28-8 assume !!(rangesum_~i~1 < 10); 5534#L29-2 [2021-10-13 00:19:59,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:19:59,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1484601769, now seen corresponding path program 3 times [2021-10-13 00:19:59,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:19:59,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431638445] [2021-10-13 00:19:59,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:19:59,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:19:59,453 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-13 00:19:59,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1169378032] [2021-10-13 00:19:59,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 00:19:59,454 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:19:59,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:19:59,467 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:19:59,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2021-10-13 00:19:59,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-10-13 00:19:59,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-10-13 00:19:59,909 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:19:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:20:00,033 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:20:00,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:00,033 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 5 times [2021-10-13 00:20:00,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:00,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038000446] [2021-10-13 00:20:00,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:00,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:20:00,039 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:20:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:20:00,042 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:20:00,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:00,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1801965686, now seen corresponding path program 4 times [2021-10-13 00:20:00,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:00,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650655031] [2021-10-13 00:20:00,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:00,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:00,054 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-13 00:20:00,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1165307463] [2021-10-13 00:20:00,055 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 00:20:00,055 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:20:00,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:20:00,068 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:20:00,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2021-10-13 00:20:00,482 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 00:20:00,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:20:00,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 00:20:00,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:20:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-10-13 00:20:00,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:20:00,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650655031] [2021-10-13 00:20:00,789 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-13 00:20:00,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165307463] [2021-10-13 00:20:00,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165307463] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:20:00,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:20:00,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:20:00,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567600617] [2021-10-13 00:20:00,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:20:00,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:20:00,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:20:00,854 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. cyclomatic complexity: 17 Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:20:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:20:00,955 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2021-10-13 00:20:00,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:20:00,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 143 transitions. [2021-10-13 00:20:00,957 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-10-13 00:20:00,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 115 states and 119 transitions. [2021-10-13 00:20:00,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2021-10-13 00:20:00,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2021-10-13 00:20:00,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 119 transitions. [2021-10-13 00:20:00,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-13 00:20:00,959 INFO L681 BuchiCegarLoop]: Abstraction has 115 states and 119 transitions. [2021-10-13 00:20:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 119 transitions. [2021-10-13 00:20:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2021-10-13 00:20:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 95 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:20:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2021-10-13 00:20:00,962 INFO L704 BuchiCegarLoop]: Abstraction has 96 states and 100 transitions. [2021-10-13 00:20:00,962 INFO L587 BuchiCegarLoop]: Abstraction has 96 states and 100 transitions. [2021-10-13 00:20:00,962 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-10-13 00:20:00,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 100 transitions. [2021-10-13 00:20:00,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-10-13 00:20:00,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-13 00:20:00,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-13 00:20:00,964 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:20:00,964 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-13 00:20:00,964 INFO L791 eck$LassoCheckResult]: Stem: 6021#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 6022#L-1 havoc main_#res;havoc main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet4, init_nondet_#t~post3, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 6038#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6039#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6040#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6041#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6105#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6104#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6103#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6101#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6099#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6097#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6095#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6093#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6091#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6089#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6087#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6085#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6083#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6082#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6080#L17-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet4, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet4; 6056#L17-2 init_nondet_#t~post3 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post3;havoc init_nondet_#t~post3; 6055#L17-3 assume !(init_nondet_~i~0 < 10); 6029#L15 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 6030#L28-3 assume !!(rangesum_~i~1 < 10); 6031#L29 assume !(rangesum_~i~1 > 5); 6032#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6035#L28-3 assume !!(rangesum_~i~1 < 10); 6033#L29 assume !(rangesum_~i~1 > 5); 6034#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6036#L28-3 assume !!(rangesum_~i~1 < 10); 6102#L29 assume !(rangesum_~i~1 > 5); 6100#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6098#L28-3 assume !!(rangesum_~i~1 < 10); 6096#L29 assume !(rangesum_~i~1 > 5); 6094#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6092#L28-3 assume !!(rangesum_~i~1 < 10); 6090#L29 assume !(rangesum_~i~1 > 5); 6088#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6086#L28-3 assume !!(rangesum_~i~1 < 10); 6084#L29 assume !(rangesum_~i~1 > 5); 6079#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6081#L28-3 assume !!(rangesum_~i~1 < 10); 6078#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6077#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6076#L28-3 assume !!(rangesum_~i~1 < 10); 6075#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6073#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6071#L28-3 assume !!(rangesum_~i~1 < 10); 6069#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6067#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6065#L28-3 assume !!(rangesum_~i~1 < 10); 6063#L29 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6061#L28-2 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6059#L28-3 assume !(rangesum_~i~1 < 10); 6051#L28-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 6045#L37 main_#t~ret7 := rangesum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem6, rangesum_#t~post5, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 6046#L28-8 assume !!(rangesum_~i~1 < 10); 6106#L29-2 assume !(rangesum_~i~1 > 5); 6042#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6043#L28-8 assume !!(rangesum_~i~1 < 10); 6116#L29-2 assume !(rangesum_~i~1 > 5); 6044#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6027#L28-8 assume !!(rangesum_~i~1 < 10); 6028#L29-2 assume !(rangesum_~i~1 > 5); 6054#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6115#L28-8 assume !!(rangesum_~i~1 < 10); 6114#L29-2 assume !(rangesum_~i~1 > 5); 6113#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6112#L28-8 assume !!(rangesum_~i~1 < 10); 6111#L29-2 assume !(rangesum_~i~1 > 5); 6110#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6108#L28-8 assume !!(rangesum_~i~1 < 10); 6109#L29-2 assume !(rangesum_~i~1 > 5); 6107#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6025#L28-8 assume !!(rangesum_~i~1 < 10); 6026#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6053#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6074#L28-8 assume !!(rangesum_~i~1 < 10); 6072#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6070#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6068#L28-8 assume !!(rangesum_~i~1 < 10); 6066#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6064#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6062#L28-8 assume !!(rangesum_~i~1 < 10); 6060#L29-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem6 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem6;havoc rangesum_#t~mem6;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 6058#L28-7 rangesum_#t~post5 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post5;havoc rangesum_#t~post5; 6057#L28-8 assume !(rangesum_~i~1 < 10); 6050#L28-9 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 6047#L37-1 main_#t~ret10 := rangesum_#res;main_~ret2~0 := main_#t~ret10;havoc main_#t~ret10;call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~2 := 0; 6048#L54-3 [2021-10-13 00:20:00,964 INFO L793 eck$LassoCheckResult]: Loop: 6048#L54-3 assume !!(main_~i~2 < 9);call main_#t~mem13 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem13, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem13; 6049#L54-2 main_#t~post12 := main_~i~2;main_~i~2 := 1 + main_#t~post12;havoc main_#t~post12; 6048#L54-3 [2021-10-13 00:20:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash 817204024, now seen corresponding path program 1 times [2021-10-13 00:20:00,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:00,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883312755] [2021-10-13 00:20:00,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:00,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:01,013 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-13 00:20:01,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [914538330] [2021-10-13 00:20:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:01,013 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:20:01,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:20:01,016 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:20:01,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-10-13 00:20:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:20:01,444 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:20:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:20:01,566 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:20:01,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:01,567 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2021-10-13 00:20:01,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:01,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162261380] [2021-10-13 00:20:01,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:01,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:20:01,572 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:20:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:20:01,575 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:20:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:20:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash -645945734, now seen corresponding path program 1 times [2021-10-13 00:20:01,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:20:01,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032760918] [2021-10-13 00:20:01,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:01,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:20:01,588 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-13 00:20:01,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1070277039] [2021-10-13 00:20:01,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:20:01,589 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:20:01,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:20:01,595 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:20:01,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2021-10-13 00:20:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:20:02,000 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:20:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:20:02,172 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:21:12,539 WARN L207 SmtUtils]: Spent 1.17 m on a formula simplification. DAG size of input: 585 DAG size of output: 405 [2021-10-13 00:24:31,253 WARN L207 SmtUtils]: Spent 21.08 s on a formula simplification that was a NOOP. DAG size: 239 [2021-10-13 00:24:31,255 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 292273 column 376: unknown constant v_ULTIMATE.start_init_nondet_#t~nondet4_40 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:237) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:256) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:133) at de.uni_freiburg.informatik.ultimate.lassoranker.nontermination.FixpointCheck.checkForFixpoint(FixpointCheck.java:100) at de.uni_freiburg.informatik.ultimate.lassoranker.nontermination.FixpointCheck.(FixpointCheck.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-13 00:24:31,259 INFO L168 Benchmark]: Toolchain (without parser) took 297237.92 ms. Allocated memory was 102.8 MB in the beginning and 262.1 MB in the end (delta: 159.4 MB). Free memory was 69.4 MB in the beginning and 83.9 MB in the end (delta: -14.6 MB). Peak memory consumption was 192.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:24:31,259 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 102.8 MB. Free memory is still 55.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:24:31,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.33 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 69.3 MB in the beginning and 98.1 MB in the end (delta: -28.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:24:31,262 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.50 ms. Allocated memory is still 123.7 MB. Free memory was 98.1 MB in the beginning and 96.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:24:31,262 INFO L168 Benchmark]: Boogie Preprocessor took 61.69 ms. Allocated memory is still 123.7 MB. Free memory was 96.0 MB in the beginning and 94.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:24:31,263 INFO L168 Benchmark]: RCFGBuilder took 460.86 ms. Allocated memory is still 123.7 MB. Free memory was 94.7 MB in the beginning and 82.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 00:24:31,264 INFO L168 Benchmark]: BuchiAutomizer took 296344.86 ms. Allocated memory was 123.7 MB in the beginning and 262.1 MB in the end (delta: 138.4 MB). Free memory was 81.8 MB in the beginning and 83.9 MB in the end (delta: -2.2 MB). Peak memory consumption was 184.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:24:31,273 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.21 ms. Allocated memory is still 102.8 MB. Free memory is still 55.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 297.33 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 69.3 MB in the beginning and 98.1 MB in the end (delta: -28.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 63.50 ms. Allocated memory is still 123.7 MB. Free memory was 98.1 MB in the beginning and 96.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 61.69 ms. Allocated memory is still 123.7 MB. Free memory was 96.0 MB in the beginning and 94.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 460.86 ms. Allocated memory is still 123.7 MB. Free memory was 94.7 MB in the beginning and 82.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 296344.86 ms. Allocated memory was 123.7 MB in the beginning and 262.1 MB in the end (delta: 138.4 MB). Free memory was 81.8 MB in the beginning and 83.9 MB in the end (delta: -2.2 MB). Peak memory consumption was 184.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: line 292273 column 376: unknown constant v_ULTIMATE.start_init_nondet_#t~nondet4_40 de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: line 292273 column 376: unknown constant v_ULTIMATE.start_init_nondet_#t~nondet4_40: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-13 00:24:31,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2021-10-13 00:24:31,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2021-10-13 00:24:31,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2021-10-13 00:24:31,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2021-10-13 00:24:32,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2021-10-13 00:24:32,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2021-10-13 00:24:32,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2021-10-13 00:24:32,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2021-10-13 00:24:32,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2021-10-13 00:24:33,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2021-10-13 00:24:33,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-10-13 00:24:33,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-10-13 00:24:33,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-10-13 00:24:33,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-10-13 00:24:34,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-10-13 00:24:34,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-10-13 00:24:34,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-10-13 00:24:34,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-10-13 00:24:34,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-10-13 00:24:35,116 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-10-13 00:24:35,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-10-13 00:24:35,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-10-13 00:24:35,891 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forcibly destroying the process [2021-10-13 00:24:35,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8abb28a-71d0-49f8-80e9-94ac447986c7/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...